Equivalencies of cordial labeling and sum divisor cordial labeling

MaRDI QIDQ5144292zbMATH OpenFDO

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

zbMATH Keywords

treegraceful graphcordial graphsum divisor cordial graph

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 3997850 (Why is no real title available?)
• scientific article; zbMATH DE number 3308125 (Why is no real title available?)
• Methods of destroying the symmetries of a graph
• 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)