A channel assignment problem for optical networks modelled by Cayley graphs

DOI10.1016/S0304-3975(03)00394-3zbMath1071.68085OpenAlexW2104103621MaRDI QIDQ1884990

Sanming Zhou

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(03)00394-3

zbMATH Keywords

Cayley graphHypercubeChannel assignmentOptical network

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analytic circuit theory (94C05)

Related Items (18)

Radio-\(k\)-labeling of cycles for large \(k\) ⋮ L(3,1)-labeling of circulant graphs ⋮ No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups ⋮ An optimal square coloring of planar graphs ⋮ Radio number for the Cartesian product of two trees ⋮ The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups ⋮ Improved lower bounds for the radio number of trees ⋮ Optimal radio labellings of block graphs and line graphs of trees ⋮ Channel assignment on Cayley graphs ⋮ Radio $k$-labeling of paths ⋮ Optimal radio labellings of complete \(m\)-ary trees ⋮ The \(L(h,1,1)\)-labelling problem for trees ⋮ Polyhedral studies for minimum‐span graph labelling with integer distance constraints ⋮ Antipodal radio labelling of full binary trees ⋮ A distance-labelling problem for hypercubes ⋮ Linear and cyclic distance-three labellings of trees ⋮ Silver cubes ⋮ Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey

Cites Work

• On automorphisms of Cayley graphs
• Conflict-Free channel set assignment for an optical cluster interconnection network based on rotator digraphs
• Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network
• A coloring problem on the \(n\)-cube
• Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
• Labelling Graphs with a Condition at Distance 2
• Labelling Cayley Graphs on Abelian Groups
• A new 5‐arc‐transitive cubic graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A channel assignment problem for optical networks modelled by Cayley graphs