The gracefulness of the join of graphs

DOI10.1016/j.endm.2015.05.009zbMath1347.05196OpenAlexW751791890MaRDI QIDQ324910

L. Y. Phoon, K. W. Soh, Khee Meng Koh

Publication date: 17 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2015.05.009

zbMATH Keywords

graceful labelingjoin of graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

The gracefulness of the join of graphs. II

Cites Work

• Graceful labelings of nearly complete graphs
• Decompositions of regular graphs into \(K^ c_ n \vee 2K_ 2\)
• On sequential labelings of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The gracefulness of the join of graphs