On labeling the vertices of products of complete graphs with distance constraints
From MaRDI portal
Publication:4667821
DOI10.1002/nav.10080zbMath1066.05126OpenAlexW2171195306MaRDI QIDQ4667821
John P. Georges, David Erwin, David W. Mauro
Publication date: 21 April 2005
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.10080
Related Items (8)
\(L(j, k)\)-number of direct product of path and cycle ⋮ \(L(2, 1)\)-labelings of the edge-path-replacement of a graph ⋮ \(L(d,1)\)-labelings of the edge-path-replacement of a graph ⋮ A survey on labeling graphs with a condition at distance two ⋮ \(L(2,1)\)-labelings of the edge-multiplicity-paths-replacement of a graph ⋮ A distance-labelling problem for hypercubes ⋮ \(L(h,k)\)-labelings of Hamming graphs ⋮ Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey
Cites Work
This page was built for publication: On labeling the vertices of products of complete graphs with distance constraints
