Graceful and cordial labeling of subdivision of graphs

DOI10.1016/j.endm.2016.05.011zbMath1347.05217OpenAlexW2515054647MaRDI QIDQ327634

Mohammad Hasan, M. Dambrine

Publication date: 19 October 2016

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

zbMATH Keywords

graceful labelingcordial labelinggraph labelingsubdivision of graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (2)

Quotient-3 Cordial Labeling for Path Related Graphs: Part-II ⋮ Unnamed Item

Cites Work

• Subdivision of ladders are graceful
• A dynamic survey of graph labeling
• One edge union of shell graphs and one vertex union of complete bipartite graphs are cordial
• Graceful numbering of an edge-gluing of shell graphs
• Cycles with a chord are graceful
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Graceful and cordial labeling of subdivision of graphs