A distance-labelling problem for hypercubes

DOI10.1016/j.dam.2007.11.018zbMath1170.05052OpenAlexW2017176397MaRDI QIDQ1005224

Sanming Zhou

Publication date: 9 March 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.11.018

zbMATH Keywords

hypercubelabellingchannel assignmentbinary code\(\lambda \)-numberdistance-colouring

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items

Characterization results for the \(L(2, 1, 1)\)-labeling problem on trees ⋮ \(L(3,2,1)\)-labeling of triangular and toroidal grids ⋮ Radio-\(k\)-labeling of cycles for large \(k\) ⋮ Distance three labelings of trees ⋮ Distance labellings of Cayley graphs of semigroups ⋮ Unnamed Item ⋮ New results on two hypercube coloring problems ⋮ Improved lower bounds for the radio number of trees ⋮ Distance-constrained labellings of Cartesian products of graphs ⋮ Optimal radio labellings of block graphs and line graphs of trees ⋮ \(l(3,2,1)\)-labeling for the product of a complete graph and a cycle ⋮ Radio $k$-labeling of paths ⋮ Optimal radio labellings of complete \(m\)-ary trees ⋮ The \(L(h,1,1)\)-labelling problem for trees ⋮ On relationship between Hamiltonian path and holes in \(L(3, 2, 1)\)-coloring of minimum span ⋮ Linear and cyclic distance-three labellings of trees ⋮ Graph coloring with cardinality constraints on the neighborhoods ⋮ Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey ⋮ $L(3,2,1)$-labeling for Cylindrical grid: the cartesian product of a path and a cycle

Cites Work

• On a hypercube coloring problem
• Hamiltonian circuits in Cayley graphs
• Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network
• A coloring problem on the \(n\)-cube
• New bounds on a hypercube coloring problem.
• A channel assignment problem for optical networks modelled by Cayley graphs
• A survey on the distance-colouring of graphs
• Labeling Products of Complete Graphs with a Condition at Distance Two
• Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey
• Labelling Graphs with a Condition at Distance 2
• Graph labeling and radio channel assignment
• On labeling the vertices of products of complete graphs with distance constraints
• On the $\lambda$-Number of $Q_n $ and Related Graphs
• Labelling Cayley Graphs on Abelian Groups
• 25 pretty graph colouring problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item