Pages that link to "Item:Q4667821"

The following pages link to On labeling the vertices of products of complete graphs with distance constraints (Q4667821):

Displaying 8 items.

• \(L(d,1)\)-labelings of the edge-path-replacement of a graph (Q386438) (← links)
• A distance-labelling problem for hypercubes (Q1005224) (← links)
• \(L(h,k)\)-labelings of Hamming graphs (Q1025475) (← links)
• \(L(j, k)\)-number of direct product of path and cycle (Q2391993) (← links)
• \(L(2, 1)\)-labelings of the edge-path-replacement of a graph (Q2392735) (← links)
• A survey on labeling graphs with a condition at distance two (Q2497501) (← links)
• Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey (Q3439628) (← links)
• \(L(2,1)\)-labelings of the edge-multiplicity-paths-replacement of a graph (Q5963629) (← links)