تسجيل الدخول

تسجيل

Firecracker Graph

المؤلف:  Chen, W.-C.; Lu, H.-I; and Yeh, Y.-N.

المصدر:  Operations of Interlaced Trees and Graceful Trees." Southeast Asian Bull. Math. 21

الجزء والصفحة:  ...

20-3-2022

2159

Firecracker Graph

 

An -firecracker is a graph obtained by the concatenation of  -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[{" src="https://mathworld.wolfram.com/images/equations/FirecrackerGraph/Inline4.svg" style="height:22px; width:6px" />"Firecracker", {" src="https://mathworld.wolfram.com/images/equations/FirecrackerGraph/Inline5.svg" style="height:22px; width:6px" />n, k}" src="https://mathworld.wolfram.com/images/equations/FirecrackerGraph/Inline6.svg" style="height:22px; width:6px" />}" src="https://mathworld.wolfram.com/images/equations/FirecrackerGraph/Inline7.svg" style="height:22px; width:6px" />].

---

 

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.