An -gonal -cone graph, also called the -point suspension of or generalized wheel graph (Buckley and Harary 1988), is defined by the graph join , where is a cyclic graph and 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.