Almost arbitrary supersubdivision of every graph is cordial

MaRDI QIDQ2829335zbMATH OpenFDO

Authors G. Sethuraman, N. Shanmugapriya

Publication date 27 October 2016

Published in JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

zbMATH Keywords

cordial labelinggraph labelingarbitrary supersubdivison graph

Mathematics Subject Classification ID

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

Recommendations

• Cordial labeling and arbitrary super subdivision of some graphs
• Some new results on cordial labeling in the context of arbitrary supersubdivision of graph
• Even complete supersubdivision of any graph is cordial
• Cordial labeling of arbitrary supersubdivision of wheel, helm, closed helm
• Cordial labeling of \(mK_ n\)

Cited in

(5)

• Some new results on cordial labeling in the context of arbitrary supersubdivision of graph
• Even complete supersubdivision of any graph is cordial
• Gracefull arbitrary supersubdivisions of graphs
• Cordial labeling and arbitrary super subdivision of some graphs
• Cordial labeling of arbitrary supersubdivision of wheel, helm, closed helm

This page was built for publication: Almost arbitrary supersubdivision of every graph is cordial

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