A new approach in finding full friendly indices

DOI10.1007/S40840-016-0373-8zbMath1387.05224OpenAlexW2341407835MaRDI QIDQ1695616

Zhen-Bin Gao, Gee-Choon Lau, Ruo-Yuan Han, Hong-Nan Ren, Sin Min Lee

Publication date: 7 February 2018

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-016-0373-8

zbMATH Keywords

friendly labelingvertex labelingfull friendly index setembedding labeling graph methodfull vertices blow-up

Mathematics Subject Classification ID

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

Related Items (1)

On friendly index and product-cordial index sets of Möbius-liked graph

Cites Work

• Full friendly index set. I
• Full friendly index sets of \(P_2 \times P_n\)
• A-cordial graphs
• Full friendly index sets of Cartesian products of two cycles
• Uniformly cordial graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A new approach in finding full friendly indices