Total magic cordial labeling of complete multipartite graphs

DOI10.1016/J.ENDM.2015.05.037zbMATH Open1347.05211OpenAlexW789371576MaRDI QIDQ324974FDOQ324974

Authors: Nataraj Neela, C. Selvaraj 

Publication date: 17 October 2016

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

Recommendations

• On totally magic cordial labeling
• Totally magic cordial labeling of \(mP_{n}\) and \(mK_{n}\)
• A totally magic cordial labeling of one-point union of n copies of a graph
• On \(k\)-totally magic cordial labeling of graphs
• Totally vertex-magic cordial labeling

zbMATH Keywords

complete multipartite graphstotal magic cordial labeling

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Some totally modular cordial graphs
• On totally magic cordial labeling
• A totally magic cordial labeling of one-point union of n copies of a graph

Cited In (7)

• Totally vertex-magic cordial labeling
• Some totally modular cordial graphs
• Totally magic cordial deficiency of some graphs
• A totally magic cordial labeling of one-point union of n copies of a graph
• On \(k\)-totally magic cordial labeling of graphs
• On totally magic cordial labeling
• Totally magic cordial labeling of \(mP_{n}\) and \(mK_{n}\)

This page was built for publication: Total magic cordial labeling of complete multipartite graphs

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