Totally vertex-magic cordial labeling

MaRDI QIDQ5403852zbMATH OpenFDO

Authors P. Jeyanthi, N. Angel Benseera

Publication date 19 March 2014

zbMATH Keywords

friendship graphsun graphtotally vertex-magic cordial

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(4)

• Hypo-k-totally magic cordial labeling of graphs
• Total magic cordial labeling of complete multipartite graphs
• Totally magic cordial deficiency of some graphs
• On totally magic cordial labeling

This page was built for publication: Totally vertex-magic cordial labeling

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