Radio number of ladder graphs
From MaRDI portal
Publication:3101605
DOI10.1080/00207160.2010.539211zbMath1232.05214OpenAlexW2071198016MaRDI QIDQ3101605
Xirong Xu, Haoli Wang, Baosheng Zhang, Yuansheng Yang, Guoqing Wang, Meiqin Luo
Publication date: 29 November 2011
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2010.539211
channel assignment problemradio numberdistance-two labellingradio labellingmulti-level distance labelling
Paths and cycles (05C38) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (3)
Distance three labellings for K n ×K 2 ⋮ Distance-constrained labeling of complete trees ⋮ Radio number for the product of a path and a complete graph
Cites Work
This page was built for publication: Radio number of ladder graphs