Equivalencies of cordial labeling and sum divisor cordial labeling

zbMATH Open1463.05487MaRDI QIDQ5144292FDOQ5144292

Authors: H. M. Makadia, V. J. Kaneria, M. J. Khoda 

Publication date: 15 January 2021

Full work available at URL: http://rsmams.org/journals/articleinfo.php?articleid=473&tag=seajmams

Recommendations

• Several results on sum divisor cordial graph
• Sum divisor cordial labeling for star and ladder related graphs
• Sum divisor cordial graphs
• Extended results on sum divisor cordial labeling
• Sum divisor cordial labeling for path and cycle related graphs

zbMATH Keywords

treegraceful graphcordial graphsum divisor cordial graph

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Title not available (Why is that?)
• Methods of destroying the symmetries of a graph
• Title not available (Why is that?)
• Sum divisor cordial graphs

Cited In (2)

• Cordial labeling of \(mK_ n\)
• Extended results on sum divisor cordial labeling

This page was built for publication: Equivalencies of cordial labeling and sum divisor cordial labeling

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