Even complete supersubdivision of any graph is cordial

MaRDI QIDQ4576339zbMATH OpenFDO

Authors G. Sethuraman, N. Shanmugapriya

Publication date 12 July 2018

zbMATH Keywords

cordial labelinggraph labelingsupersubdivision graphs cordial graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Almost arbitrary supersubdivision of every graph is cordial
• Cordial labeling and arbitrary super subdivision of some graphs
• Some new results on cordial labeling in the context of arbitrary supersubdivision of graph
• Cordial labeling of arbitrary supersubdivision of wheel, helm, closed helm
• scientific article; zbMATH DE number 4210188

Cited in

(4)

• A lower bound and several exact results on the \(d\)-lucky number
• Almost arbitrary supersubdivision of every graph is cordial
• Cordial labeling and arbitrary super subdivision of some graphs
• Some new results on cordial labeling in the context of arbitrary supersubdivision of graph

This page was built for publication: Even complete supersubdivision of any graph is cordial

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