TOPICS
Search

Singleton Graph


SingletonGraph

The singleton graph is the graph consisting of a single isolated node with no edges. It is therefore the empty graph on one node. It is commonly denoted K_1 (i.e., the complete graph on one node).

By convention, the singleton graph is considered to be Hamiltonian (B. McKay, pers. comm., Mar. 22, 2007).


See also

Complete Graph, Empty Graph, Graph, Hoffman-Singleton Graph

Explore with Wolfram|Alpha

Cite this as:

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

Subject classifications