Full edge-friendly index sets of complete bipartite graphs

DOI10.22108/toc.2017.20739zbMath1463.05497OpenAlexW2588735096MaRDI QIDQ5134532

No author found.

Publication date: 17 November 2020

Full work available at URL: https://journals.ui.ac.ir/article_20739_045d1f054d5254d803c8df777bac0d71.pdf

zbMATH Keywords

complete bipartite graphedge-friendly labelingedge-friendly indexfull edge-friendly index sets

Mathematics Subject Classification ID

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

Cites Work

• Full friendly index set. I
• Full friendly index sets of \(P_2 \times P_n\)
• On friendly index sets of 2-regular graphs
• Full friendly index sets of Cartesian products of two cycles
• 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 edge-friendly index sets of complete bipartite graphs