Channel assignment on Cayley graphs
From MaRDI portal
Publication:3018071
DOI10.1002/JGT.20523zbMATH Open1222.05228OpenAlexW2081605753MaRDI QIDQ3018071FDOQ3018071
Authors: Patrick Bahls
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
Recommendations
Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Communication networks in operations research (90B18)
Cites Work
- Labelling Graphs with a Condition at Distance 2
- Graph labeling and radio channel assignment
- Title not available (Why is that?)
- Orthogonal systems in vector spaces over finite fields
- Real Number Channel Assignments for Lattices
- A channel assignment problem for optical networks modelled by Cayley graphs
- Labelling Cayley Graphs on Abelian Groups
- No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups
Cited In (8)
- Task assignment in Cayley interconnection topologies
- Bounds on Point Configurations Determined by Distances and Dot Products
- The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups
- \(L(2, 1)\)-labeling of circulant graphs
- \(L(3,1)\)-labeling of circulant graphs
- Channel graphs of bit permutation networks
- A channel assignment problem for optical networks modelled by Cayley graphs
- Transformations on channel graphs
This page was built for publication: Channel assignment on Cayley graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3018071)