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

DOI10.1016/J.DAM.2016.01.024MaRDI QIDQ335331zbMATHOpenAlexFDO

Authors Zhenbin Gao, Guang-Yi Sun, 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 labelingfull friendly index setN-gridvertex labeling

Mathematics Subject Classification ID

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

Recommendations

• Full friendly index sets of \(P_2 \times P_n\)
• On friendly index sets of 2-regular graphs
• On friendly index sets of \((p,p+1)\)-graphs
• Friendly index sets and friendly index numbers of some graphs
• On friendly index sets of bipartite graphs
• On friendly index set of hypercube \(Q_n\)
• On friendly index sets of total graphs of trees
• scientific article; zbMATH DE number 6096644
• Upper bound of embedding index in grid graphs
• Full edge-friendly index sets of complete bipartite graphs

Cites work

• scientific article; zbMATH DE number 6007735 (Why is no real title available?)
• scientific article; zbMATH DE number 6096644 (Why is no real title available?)
• scientific article; zbMATH DE number 3997850 (Why is no real title available?)
• scientific article; zbMATH DE number 5206696 (Why is no real title available?)
• A-cordial graphs
• Full friendly index set. I
• Full friendly index sets and full product-cordial index sets of some permutation Petersen graphs
• Full friendly index sets and full product-cordial index sets of twisted cylinders
• Full friendly index sets of Cartesian products of two cycles
• Full friendly index sets of \(P_2 \times P_n\)
• Full friendly index sets of slender and flat cylinder graphs
• On friendly index sets of 2-regular graphs
• On friendly index sets of generalized books
• On friendly index sets of prisms and Möbius ladders

Cited in

(4)

• The vertex Euclidean properties of graphs
• Full friendly index sets of \(P_2 \times P_n\)
• Full-edge friendly index sets of fan
• Friendly index sets and friendly index numbers of some graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q335331)