L(h, k)-labelling for octagonal grid

DOI10.1080/00207160.2014.981536zbMATH Open1334.05144OpenAlexW2045526184MaRDI QIDQ2804024FDOQ2804024

Authors: Byeong Moon Kim, Yoomi Rho, Byung Chul Song 

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

Recommendations

• Optimal \(L(h,k)\)-labeling of regular grids
• Optimal \(L(\delta_1,\delta_2,1)\)-labeling of eight-regular grids
• Improved bounds on the span of \(L(1,2)\)-edge labeling of some infinite regular grids
• Optimal \(L(j,k)\)-edge-labeling of regular grids
• No-hole \(\lambda-L(k,k-1,\dots,2,1)\)-labeling for square grid

zbMATH Keywords

channel assignment problemstrong productwireless network\(L(h, k)\)-labellingoctagonal grid

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• Optimal \(L(\delta_1,\delta_2,1)\)-labeling of eight-regular grids
• New and modified eccentric indices of octagonal grid \(O^m_n\)
• On \(L(h,k)\)-labeling index of inverse graphs associated with finite cyclic groups
• Frequency assignment problem in networks with limited spectrum
• Optimal \(L(h,k)\)-labeling of regular grids

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

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