L(h,k)-labelling for octagonal grid

DOI10.1080/00207160.2014.981536zbMath1334.05144OpenAlexW2045526184MaRDI QIDQ2804024

Byung Chul Song, Yoomi Rho, Byeong Moon Kim

Publication date: 27 April 2016

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2014.981536

zbMATH Keywords

wireless networkstrong productchannel assignment problem\(L(h, k)\)-labellingoctagonal grid

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Channel models (including quantum) in information and communication theory (94A40)

Related Items (2)

Frequency assignment problem in networks with limited spectrum ⋮ On \(L(h,k)\)-labeling index of inverse graphs associated with finite cyclic groups

Cites Work

• \(L(p,q)\)-labeling of a graph embeddable on the torus
• On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs
• \(L(2,1)\)-labeling of strong products of cycles
• \(L(2,1)\)-labeling of direct product of paths and cycles
• \(L(p,q)\)-labeling of sparse graphs
• Circular \(L(j,k)\)-labeling number of direct product of path and cycle
• \(L(2,1)\)-labelings of Cartesian products of two cycles
• A survey on labeling graphs with a condition at distance two
• Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles
• Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice
• Labelling Graphs with a Condition at Distance 2
• On the $\lambda$-Number of $Q_n $ and Related Graphs

This page was built for publication: L(h,k)-labelling for octagonal grid