Hypo-k-totally magic cordial labeling of graphs

DOI10.4067/S0716-09172015000400004zbMATH Open1339.05353OpenAlexW2477749566MaRDI QIDQ2812613FDOQ2812613

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

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

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)

Cites Work

• Title not available (Why is that?)
• Some totally modular cordial graphs
• 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

Cited In (3)

• Title not available (Why is that?)
• A totally magic cordial labeling of one-point union of n copies of a graph
• 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)