TOPICS
Search

Graph Vertex


GraphNodesEdges

A graph vertex is a node of a graph, i.e., one of the points on which the graph is defined and which may be connected by graph edges. The terms "point," "junction," and 0-simplex are also used (Skiena 1990, p. 80; Harary 1994).

The following tables give the total numbers of graph vertices for various classes of graphs on n=1, 2, ... nodes.

graph typeOEIStotal node count for n=1, 2, ... nodes
graphA0555421, 4, 12, 44, 170, 936, 7308, 98768, 2472012, ...
labeled graphA0953401, 4, 24, 256, 5120, 196608, ...
labeled treeA0001691, 2, 9, 64, 625, 7776, 117649, ...
planted treeA0953410, 2, 3, 8, 20, 54, 140, 384, 1035, 2860, ...
rooted treeA0555441, 2, 6, 16, 45, 120, 336, 920, 2574, ...
treeA0555431, 2, 3, 8, 15, 36, 77, 184 ...

See also

Graph, Graph Edge, Graph Face, Null Graph, Polygon Vertex, Tait Coloring, Tait Cycle, Tait's Hamiltonian Graph Conjecture

Explore with Wolfram|Alpha

References

Harary, F. Graph Theory. Reading, MA: Addison-Wesley, 1994.Skiena, S. Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Reading, MA: Addison-Wesley, 1990.Sloane, N. J. A. Sequences A000169/M1946, A055542, A055543, A055544, A095340, and A095341 in "The On-Line Encyclopedia of Integer Sequences."

Referenced on Wolfram|Alpha

Graph Vertex

Cite this as:

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

Subject classifications