Distance Labelling Problems for Hypercubes and Hamming Graphs β A Survey
From MaRDI portal
Publication:3439628
DOI10.1016/J.ENDM.2007.01.073zbMATH Open1291.05150OpenAlexW2078951525MaRDI QIDQ3439628FDOQ3439628
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
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12) Hypergraphs (05C65)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Labelling Graphs with a Condition at Distance 2
- A distance-labelling problem for hypercubes
- Graph labeling and radio channel assignment
- A coloring problem on the \(n\)-cube
- New bounds on a hypercube coloring problem.
- On the $\lambda$-Number of $Q_n $ and Related Graphs
- On a hypercube coloring problem
- Labeling products of complete graphs with a condition at distance two
- On labeling the vertices of products of complete graphs with distance constraints
- Hamiltonian circuits in Cayley graphs
- Title not available (Why is that?)
- Hamiltonicity and circular distance two labellings
- Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network
- Distance-two labellings of Hamming graphs
- A channel assignment problem for optical networks modelled by Cayley graphs
- Labelling Cayley Graphs on Abelian Groups
- No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups
Cited In (7)
- Path covering number and \(L(2,1)\)-labeling number of graphs
- Distance-constrained labellings of Cartesian products of graphs
- 2-distance colorings of some direct products of paths and cycles
- A distance-labelling problem for hypercubes
- The \(L(h,1,1)\)-labelling problem for trees
- Distance-two labellings of Hamming graphs
- Distance three labellings for K n ΓK 2
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 π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- \(L(h,k)\)-labelings of Hamming graphs π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
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)