Almost arbitrary supersubdivision of every graph is cordial

zbMATH Open1351.05198MaRDI QIDQ2829335FDOQ2829335

N. Shanmugapriya, G. Sethuraman

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)

Cited In (1)

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