On labeling the vertices of products of complete graphs with distance constraints
From MaRDI portal
Publication:4667821
DOI10.1002/nav.10080zbMath1066.05126MaRDI QIDQ4667821
David Erwin, John P. Georges, 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
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
Related Items
A distance-labelling problem for hypercubes, \(L(h,k)\)-labelings of Hamming graphs, \(L(j, k)\)-number of direct product of path and cycle, \(L(2, 1)\)-labelings of the edge-path-replacement of a graph, A survey on labeling graphs with a condition at distance two, Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey
Cites Work