On friendly index sets of 2-regular graphs

DOI10.1016/j.disc.2007.10.018zbMath1163.05026OpenAlexW2096054909MaRDI QIDQ998432

Ho Kuen Ng, Harris Kwong, Sin Min Lee

Publication date: 28 January 2009

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

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

zbMATH Keywords

cyclefriendly index setcordialityfriendly labelingvertex labeling2-regular graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (10)

On friendly index and product-cordial index sets of Möbius-liked graph ⋮ On product-cordial index sets and friendly index sets of 2-regular graphs and generalized wheels ⋮ Full-edge friendly index sets of fan ⋮ On friendly index sets of the edge-gluing of complete graph and cycles ⋮ On full friendly index sets of 1-level and 2-levels N-grids ⋮ Unnamed Item ⋮ Full friendly index set. I ⋮ Full edge-friendly index sets of complete bipartite graphs ⋮ Unnamed Item ⋮ On friendly index sets of k-galaxies

Cites Work

• The cordiality of one-point union of \(n\) copies of a graph
• A-cordial graphs
• Cordial labeling of \(mK_ n\)
• The computational complexity of cordial and equitable labelling
• NEPS operations on cordial graphs
• On cordial and balanced labelings of graphs
• The cordiality of the path-union of \(n\) copies of a graph
• Uniformly cordial graphs
• Unnamed Item
• Unnamed Item
• 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: On friendly index sets of 2-regular graphs