On full friendly index sets of 1-level and 2-levels N-grids

DOI10.1016/J.DAM.2016.01.024zbMath1348.05174OpenAlexW2346030772MaRDI QIDQ335331

Guang-Yi Sun, Zhen-Bin Gao, Sin Min Lee

Publication date: 2 November 2016

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

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

zbMATH Keywords

friendly index setfriendly labelingvertex labelingfull friendly index setN-grid

Mathematics Subject Classification ID

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

Related Items (1)

The vertex Euclidean properties of graphs

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
• A-cordial 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

This page was built for publication: On full friendly index sets of 1-level and 2-levels N-grids