[Go to site: main page, start]

TOPICS
Search

Open Graph Neighborhood


The open graph neighborhood of a graph vertex v in a graph G is the set

 N(v)={u:uv in E(G)},

consisting of the vertices adjacent to v, but not v itself. Adding v gives the closed neighborhood N[v]=N(v) union {v}.

Two nonadjacent vertices are false twins exactly when their open graph neighborhoods are equal.


See also

Closed Neighborhood, False Twin, Graph Neighborhood, Twin Vertices

Explore with Wolfram|Alpha

References

Brandstädt, A.; Le, V. B.; and Spinrad, J. P. Graph Classes: A Survey. Philadelphia, PA: SIAM, 1999.

Cite this as:

Weisstein, Eric W. "Open Graph Neighborhood." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/OpenGraphNeighborhood.html

Subject classifications