A distance-labelling problem for hypercubes

DOI10.1016/J.DAM.2007.11.018MaRDI QIDQ1005224zbMATH OpenOpenAlexFDO

Authors 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

\(\lambda \)-numberbinary codechannel assignmentdistance-colouringhypercubelabelling

Mathematics Subject Classification ID

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

Recommendations

• A Radio Coloring of a Hypercube
• L(3,2,1)-labeling of graphs
• Distance-constrained labellings of Cartesian products of graphs
• On the $\lambda$-Number of $Q_n $ and Related Graphs
• scientific article; zbMATH DE number 2145257

Cites work

• 25 pretty graph colouring problems
• A channel assignment problem for optical networks modelled by Cayley graphs
• A coloring problem on the \(n\)-cube
• A survey on the distance-colouring of graphs
• Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey
• Graph labeling and radio channel assignment
• Hamiltonian circuits in Cayley graphs
• scientific article; zbMATH DE number 3577438 (Why is no real title available?)
• scientific article; zbMATH DE number 607286 (Why is no real title available?)
• scientific article; zbMATH DE number 1775058 (Why is no real title available?)
• scientific article; zbMATH DE number 1439442 (Why is no real title available?)
• Labeling products of complete graphs with a condition at distance two
• Labelling Cayley Graphs on Abelian Groups
• Labelling Graphs with a Condition at Distance 2
• Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network
• New bounds on a hypercube coloring problem.
• On a hypercube coloring problem
• On labeling the vertices of products of complete graphs with distance constraints
• On the $\lambda$-Number of $Q_n $ and Related Graphs

Cited in

(21)

• Graph coloring with cardinality constraints on the neighborhoods
• On relationship between Hamiltonian path and holes in \(L(3, 2, 1)\)-coloring of minimum span
• Radio-\(k\)-labeling of cycles for large \(k\)
• 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
• Characterization results for the \(L(2, 1, 1)\)-labeling problem on trees
• New results on two hypercube coloring problems
• L(3,2,1)-labeling of triangular and toroidal grids
• Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey
• Distance three labelings of trees
• A Radio Coloring of a Hypercube
• \(l(3,2,1)\)-labeling for the product of a complete graph and a cycle
• Radio \(k\)-labeling of paths
• \(L(3,2,1)\)-labeling for cylindrical grid: the Cartesian product of a path and a cycle
• Structural Information and Communication Complexity
• scientific article; zbMATH DE number 7688018 (Why is no real title available?)
• Linear and cyclic distance-three labellings of trees
• Distance labellings of Cayley graphs of semigroups
• Optimal radio labellings of complete m-ary trees
• The \(L(h,1,1)\)-labelling problem for trees

This page was built for publication: A distance-labelling problem for hypercubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1005224)