The gracefulness of the join of graphs
From MaRDI portal
Publication:324910
DOI10.1016/J.ENDM.2015.05.009zbMATH Open1347.05196OpenAlexW751791890MaRDI QIDQ324910FDOQ324910
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
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)
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)
