Distance three labellings for K n ×K 2
From MaRDI portal
Publication:2855724
DOI10.1080/00207160.2012.748896zbMath1273.05193OpenAlexW2318132621MaRDI QIDQ2855724
Byeong Moon Kim, Woonjae Hwang, Byung Chul Song
Publication date: 22 October 2013
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2012.748896
Trees (05C05) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph designs and isomorphic decomposition (05C51)
Related Items (2)
\(L(2,1)\)-labeling of interval graphs ⋮ $L(3,2,1)$-labeling for Cylindrical grid: the cartesian product of a path and a cycle
Cites Work
- Radio number for trees
- Recent progress in mathematics and engineering on optimal graph labellings with distance conditions
- \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs
- 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
- Radio number of ladder graphs
- Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey
- L(h,1,1)-Labeling of Outerplanar Graphs
- Labelling Graphs with a Condition at Distance 2
- Multilevel Distance Labelings for Paths and Cycles
This page was built for publication: Distance three labellings for K n ×K 2
