Almost arbitrary supersubdivision of every graph is cordial

zbMATH Open1351.05198MaRDI QIDQ2829335FDOQ2829335

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)

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\)

zbMATH Keywords

cordial labelinggraph labelingarbitrary supersubdivison graph

Mathematics Subject Classification ID

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

Cited In (5)

• Cordial labeling and arbitrary super subdivision of some graphs
• Cordial labeling of arbitrary supersubdivision of wheel, helm, closed helm
• 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

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)