Hypo-k-totally magic cordial labeling of graphs

DOI10.4067/S0716-09172015000400004MaRDI QIDQ2812613zbMATHOpenAlexFDO

Authors P. Jeyanthi, N. Angel Benseera, Gee-Choon Lau

Publication date 17 June 2016

Published in Proyecciones (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4067/s0716-09172015000400004

zbMATH Keywords

wheel graphcomplete graphcomplete bipartite graph\(k\)-totally magic cordial labelinghypo-\(k\)-totally magic cordial graphhypo-\(k\)-totally magic cordial labeling

Mathematics Subject Classification ID

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

Recommendations

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

Cites work

• scientific article; zbMATH DE number 3997850 (Why is no real title available?)
• A totally magic cordial labeling of one-point union of n copies of a graph
• On \(k\)-totally magic cordial labeling of graphs
• Some totally modular cordial graphs
• Totally vertex-magic cordial labeling

Cited in

(3)

• A totally magic cordial labeling of one-point union of n copies of a graph
• scientific article; zbMATH DE number 6269011 (Why is no real title available?)
• On \(k\)-totally magic cordial labeling of graphs

This page was built for publication: Hypo-\(k\)-totally magic cordial labeling of graphs

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