Distance-two labellings of Hamming graphs

DOI10.1016/J.DAM.2009.01.001MaRDI QIDQ1026152zbMATH OpenOpenAlexFDO

Authors Sanming Zhou, Gerard Jennhwa Chang, Changhong 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)

Recommendations

• \(L(h,k)\)-labelings of Hamming graphs
• Distance-constrained labellings of Cartesian products of graphs
• Labelling Graphs with a Condition at Distance 2
• Labelling Cayley Graphs on Abelian Groups
• scientific article; zbMATH DE number 1409224

Cites work

• scientific article; zbMATH DE number 1185300 (Why is no real title available?)
• scientific article; zbMATH DE number 844150 (Why is no real title available?)
• scientific article; zbMATH DE number 1439401 (Why is no real title available?)
• scientific article; zbMATH DE number 1439442 (Why is no real title available?)
• scientific article; zbMATH DE number 2188369 (Why is no real title available?)
• Bounding the bandwidths for graphs
• Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey
• Distance-two labelings of graphs
• Graph labeling and radio channel assignment
• Hamiltonicity and circular distance two labellings
• Labeling Chordal Graphs: Distance Two Condition
• 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
• Minimum span of no-hole \((r+1)\)-distant colorings
• No-hole 2-distant colorings
• No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups
• No-hole \((r+1)\)-distant colorings
• No-hole \(k\)-tuple \((r+1)\)-distant colorings
• Relating path coverings to vertex labellings with a condition at distance two
• The $L(2,1)$-Labeling Problem on Graphs
• \(L(2,1)\)-labelings of Cartesian products of two cycles
• \(T\)-colorings of graphs: recent results and open problems

Cited in

(18)

• Distance two edge labelings of lattices
• Distance-constrained labellings of Cartesian products of graphs
• scientific article; zbMATH DE number 5139444 (Why is no real title available?)
• No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups
• Linear and cyclic distance-three labellings of trees
• The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups
• Radio \(k\)-labeling of paths
• Labelling Cayley Graphs on Abelian Groups
• Distance labellings of Cayley graphs of semigroups
• Optimal radio labellings of complete \(m\)-ary trees
• The \(L(h,1,1)\)-labelling problem for trees
• On the canonical metric representation, average distance, and partial Hamming graphs
• Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey
• \(L(h,k)\)-labelings of Hamming graphs
• Labelling Hamiltonian cycles of the Johnson graph
• Hamming distance between the strings generated by adjacency matrix of a subgraph complementary graph and their sum
• Hamiltonicity and circular distance two labellings
• Constant 2-labellings and an application to \((r, a, b)\)-covering codes

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

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