TOPICS
Search

Firecracker Graph


Firecracker

An (n,k)-firecracker is a graph obtained by the concatenation of n k-stars by linking one leaf from each (Chen et al. 1997, Gallian 2007).

Firecracker graphs are graceful (Chen et al. 1997, Gallian 2018).

Precomputed properties of firecrackers are implemented in the Wolfram Language as GraphData[{"Firecracker", {n, k}}].


See also

Caterpillar Graph, Centipede Graph, Lobster Graph, Star Graph, Tree

Explore with Wolfram|Alpha

References

Chen, W.-C.; Lu, H.-I; and Yeh, Y.-N. "Operations of Interlaced Trees and Graceful Trees." Southeast Asian Bull. Math. 21, 337-348, 1997.Gallian, J. "Dynamic Survey of Graph Labeling." Elec. J. Combin. DS6. Dec. 21, 2018. https://www.combinatorics.org/ojs/index.php/eljc/article/view/DS6.

Referenced on Wolfram|Alpha

Firecracker Graph

Cite this as:

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

Subject classifications