Some totally modular cordial graphs

DOI10.7151/DMGT.1173MaRDI QIDQ4435561zbMATH OpenOpenAlexFDO

Authors 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

cordial labellingmagic graphssequential graphs

Mathematics Subject Classification ID

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

Recommendations

• On totally magic cordial labeling
• Totally magic cordial labeling of \(mP_{n}\) and \(mK_{n}\)
• Total mean cordial labeling of graphs
• On k-totally magic cordial labeling of graphs
• Total magic cordial labeling of complete multipartite graphs

Cited in

(5)

• Hypo-k-totally magic cordial labeling of graphs
• Generalization of some results on cordial graphs.
• Total magic cordial labeling of complete multipartite graphs
• On k-totally magic cordial labeling of graphs
• Algorithmic approach of cordial labeling on Cartesian product between balanced bipartite graph and path

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

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