Uniformly cordial graphs

DOI10.1016/j.disc.2005.11.025zbMath1092.05058OpenAlexW2114516238MaRDI QIDQ2495510

Gary Chartrand, Ping Zhang, Sin Min Lee

Publication date: 30 June 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.11.025

zbMATH Keywords

cordial labelingfriendly labeling

Mathematics Subject Classification ID

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

Related Items (6)

On friendly index sets of the edge-gluing of complete graph and cycles ⋮ Full friendly index set. I ⋮ A new approach in finding full friendly indices ⋮ Full friendly index sets of \(P_2 \times P_n\) ⋮ On friendly index sets of 2-regular graphs ⋮ On friendly index sets of k-galaxies

Cites Work

• The cordiality of one-point union of \(n\) copies of a graph
• NEPS operations on cordial graphs
• The cordiality of the path-union of \(n\) copies of a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Uniformly cordial graphs