Cone Graph

An m-gonal n-cone graph, also called the n-point suspension of C_m or generalized wheel graph (Buckley and Harary 1988), is defined by the graph join C_m+K^__n, where C_m is a cyclic graph and K^__n is an empty graph (Gallian 2007).

Special cases are summarized in the following table.

Buckley and Harary (1988) consider the graph dimension of the cone graph.

Precomputed properties of cone graphs are implemented in the Wolfram Language as GraphData[{Cone, {m, n}}].


Embeddings of a number of small cone graphs are illustrated above.

See also

Complete Tripartite Graph, Dipyramidal Graph, Graph Join, k-Tree, Wheel Graph

Explore with Wolfram|Alpha


Buckley, F. and Harary, F. "On the Euclidean Dimension of a Wheel." Graphs and Combin. 4, 23-30, 1988.Gallian, J. "Dynamic Survey of Graph Labeling." Elec. J. Combin. DS6. Dec. 21, 2018.

Referenced on Wolfram|Alpha

Cone Graph

Cite this as:

Weisstein, Eric W. "Cone Graph." From MathWorld--A Wolfram Web Resource.

Subject classifications