L(h,k)-labelings of Hamming graphs
From MaRDI portal
\(L(h,k)\)-labelings of Hamming graphs
Recommendations
Cites work
- A survey on labeling graphs with a condition at distance two
- scientific article; zbMATH DE number 1185300 (Why is no real title available?)
- scientific article; zbMATH DE number 1439442 (Why is no real title available?)
- 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
- Models and solution techniques for frequency assignment problems
- On \(L(d,1)\)-labelings of graphs
- On labeling the vertices of products of complete graphs with distance constraints
- On the $\lambda$-Number of $Q_n $ and Related Graphs
- The $L(2,1)$-Labeling Problem on Graphs
Cited in
(13)- Distance-two labellings of Hamming graphs
- On \(L(h,k)\)-labeling index of inverse graphs associated with finite cyclic groups
- Distance-constrained labellings of Cartesian products of graphs
- Antibandwidth and cyclic antibandwidth of Hamming graphs
- scientific article; zbMATH DE number 5917762 (Why is no real title available?)
- Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey
- scientific article; zbMATH DE number 5778154 (Why is no real title available?)
- $L(2,1)$-Labeling of Hamiltonian graphs with Maximum Degree 3
- Distance two labeling on the square of a cycle
- Labelling Cayley Graphs on Abelian Groups
- \(L(h,k)\) labelings of \(K_n-M\) and \(K_n-P_m\) for all values of \(h\) and \(k^\ast\)
- L(p,q)-labeling and integer tension of a graph embedded on torus
- On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs
This page was built for publication: \(L(h,k)\)-labelings of Hamming graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1025475)