Distance-two labellings of Hamming graphs

DOI10.1016/j.dam.2009.01.001zbMath1213.05231OpenAlexW1985079310MaRDI QIDQ1026152

Sanming Zhou, Gerard Jennhwa Chang, Chang-hong Lu

Publication date: 24 June 2009

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

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

zbMATH Keywords

Hamming graphchannel assignment\(\lambda \)-number\(L(j, k)\)-labellingcyclic \(L(j, k)\)-labellingno-hole \(L(j, k)\)-labellingno-hole cyclic \(L(j, k)\)-labelling

Mathematics Subject Classification ID

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

Related Items (10)

No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups ⋮ Distance labellings of Cayley graphs of semigroups ⋮ The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups ⋮ Distance two edge labelings of lattices ⋮ Distance-constrained labellings of Cartesian products of graphs ⋮ Radio $k$-labeling of paths ⋮ Optimal radio labellings of complete \(m\)-ary trees ⋮ The \(L(h,1,1)\)-labelling problem for trees ⋮ Linear and cyclic distance-three labellings of trees ⋮ Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey

Cites Work

• No-hole \((r+1)\)-distant colorings
• No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups
• \(T\)-colorings of graphs: recent results and open problems
• No-hole 2-distant colorings
• Relating path coverings to vertex labellings with a condition at distance two
• Bounding the bandwidths for graphs
• Distance-two labelings of graphs
• No-hole \(k\)-tuple \((r+1)\)-distant colorings
• \(L(2,1)\)-labelings of Cartesian products of two cycles
• Labeling Products of Complete Graphs with a Condition at Distance Two
• Minimum Span of No-Hole (r+1)-Distant Colorings
• Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey
• Labelling Graphs with a Condition at Distance 2
• Graph labeling and radio channel assignment
• Labeling Chordal Graphs: Distance Two Condition
• The $L(2,1)$-Labeling Problem on Graphs
• Labelling Cayley Graphs on Abelian Groups
• Hamiltonicity and circular distance two labellings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Distance-two labellings of Hamming graphs