The gracefulness of the join of graphs

DOI10.1016/J.ENDM.2015.05.009zbMATH Open1347.05196OpenAlexW751791890MaRDI QIDQ324910FDOQ324910

Authors: L. Y. Phoon, K. W. Soh, K. M. Koh 

Publication date: 17 October 2016

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

Recommendations

• The gracefulness of the join of graphs. II
• The graceful graphs on several kinds of union graphs
• Researches on gracefulness of graphs \((P^{(1)}_1\vee P_n)\cup (P^{(2)}_1\vee P_{2n})\) and \((P_2\vee \overline{K}_n)\cup G_{n-1}\)
• scientific article; zbMATH DE number 2191999
• On the gracefulness of the unconnected graph \((P_1\vee P_m)\cup C_{4n}\cup P_2\)

zbMATH Keywords

join of graphsgraceful labeling

Mathematics Subject Classification ID

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

Cites Work

• On sequential labelings of graphs
• Graceful labelings of nearly complete graphs
• Decompositions of regular graphs into \(K^ c_ n \vee 2K_ 2\)
• New families of graceful disconnected graphs.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• The gracefulness of the join of graphs. II

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324910)