Some totally modular cordial graphs

DOI10.7151/dmgt.1173zbMath1035.05076OpenAlexW2006552596MaRDI QIDQ4435561

I. Cahit

Publication date: 17 November 2003

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1173

zbMATH Keywords

magic graphscordial labellingsequential graphs

Mathematics Subject Classification ID

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

Related Items (4)

On k-totally magic cordial labeling of graphs ⋮ Total magic cordial labeling of complete multipartite graphs ⋮ Algorithmic approach of cordial labeling on Cartesian product between balanced bipartite graph and path ⋮ Hypo-k-Totally Magic Cordial Labeling of Graphs

This page was built for publication: Some totally modular cordial graphs