Hypo-k-Totally Magic Cordial Labeling of Graphs

DOI10.4067/S0716-09172015000400004zbMath1339.05353OpenAlexW2477749566MaRDI QIDQ2812613

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

Publication date: 17 June 2016

Published in: Proyecciones (Antofagasta) (Search for Journal in Brave)

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

zbMATH Keywords

complete bipartite graphcomplete graphwheel 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

• Unnamed Item
• Unnamed Item
• On k-totally magic cordial labeling of graphs
• Some totally modular cordial graphs
• A totally magic cordial labeling of one-point union of n copies of a graph

This page was built for publication: Hypo-k-Totally Magic Cordial Labeling of Graphs