Full friendly index set. I

DOI10.1016/j.dam.2012.10.028zbMath1277.05149OpenAlexW1993063780MaRDI QIDQ385157

Deepa Sinha, Jaspreet Kaur

Publication date: 29 November 2013

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

Full work available at URL: https://doi.org/10.1016/j.dam.2012.10.028

zbMATH Keywords

cordial labelingfriendly labelingfull friendly index set

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph operations (line graphs, products, etc.) (05C76)

Related Items (6)

Full-edge friendly index sets of fan ⋮ Neighbourhood V₄–magic labeling of some star and path related graphs ⋮ On full friendly index sets of 1-level and 2-levels N-grids ⋮ A new approach in finding full friendly indices ⋮ Full edge-friendly index sets of complete bipartite graphs ⋮ Unnamed Item

Cites Work

• Full friendly index sets of \(P_2 \times P_n\)
• On friendly index sets of 2-regular graphs
• A-cordial graphs
• Cordial labeling of \(mK_ n\)
• A dynamic survey of graph labeling
• The computational complexity of cordial and equitable labelling
• On cordial and balanced labelings of graphs
• Uniformly cordial graphs
• The bisection width of cubic 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Full friendly index set. I