Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey

DOI10.1016/j.endm.2007.01.073zbMath1291.05150OpenAlexW2078951525MaRDI QIDQ3439628

Sanming Zhou

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2007.01.073

Mathematics Subject Classification ID

Hypergraphs (05C65) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (7)

Path covering number and \(L(2,1)\)-labeling number of graphs ⋮ Distance-constrained labellings of Cartesian products of graphs ⋮ The \(L(h,1,1)\)-labelling problem for trees ⋮ A distance-labelling problem for hypercubes ⋮ Distance-two labellings of Hamming graphs ⋮ Distance three labellings for K _n ×K ₂ ⋮ 2-distance colorings of some direct products of paths and cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a hypercube coloring problem
• No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups
• A distance-labelling problem for hypercubes
• Distance-two labellings of Hamming graphs
• 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
• Labeling Products of Complete Graphs with a Condition at Distance Two
• 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
• Hamiltonicity and circular distance two labellings

This page was built for publication: Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey