Channel assignment on Cayley graphs
From MaRDI portal
Publication:3018071
DOI10.1002/jgt.20523zbMath1222.05228OpenAlexW2081605753MaRDI QIDQ3018071
Publication date: 21 July 2011
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20523
Communication networks in operations research (90B18) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items
\(L(2, 1)\)-labeling of circulant graphs, Bounds on Point Configurations Determined by Distances and Dot Products, L(3,1)-labeling of circulant graphs, The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups
Cites Work
- Unnamed Item
- No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups
- Orthogonal systems in vector spaces over finite fields
- A channel assignment problem for optical networks modelled by Cayley graphs
- Real Number Channel Assignments for Lattices
- Labelling Graphs with a Condition at Distance 2
- Graph labeling and radio channel assignment
- Labelling Cayley Graphs on Abelian Groups