Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey

DOI10.1016/J.ENDM.2007.01.073MaRDI QIDQ3439628zbMATHOpenAlexFDO

Authors 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

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

Recommendations

• Distance-two labellings of Hamming graphs
• A distance-labelling problem for hypercubes
• Distance labeling in graphs (extended abstract)
• On the Hamming distance in combinatorial optimization problems on hypergraph matchings
• On \(L(2,1)\)-labellings of distance graphs
• scientific article; zbMATH DE number 1409224
• Distance labellings of graphs
• \(L(h,k)\)-labelings of Hamming graphs
• scientific article; zbMATH DE number 5139444
• scientific article; zbMATH DE number 5778154

Cites work

• scientific article; zbMATH DE number 1775058 (Why is no real title available?)
• scientific article; zbMATH DE number 821271 (Why is no real title available?)
• scientific article; zbMATH DE number 1439442 (Why is no real title available?)
• A channel assignment problem for optical networks modelled by Cayley graphs
• A coloring problem on the \(n\)-cube
• A distance-labelling problem for hypercubes
• Distance-two labellings of Hamming graphs
• Graph labeling and radio channel assignment
• Hamiltonian circuits in Cayley graphs
• Hamiltonicity and circular distance two labellings
• 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.
• No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups
• 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

(7)

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

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

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