Pages that link to "Item:Q4667824"
From MaRDI portal
The following pages link to Graph distance‐dependent labeling related to code assignment in computer networks (Q4667824):
Displayed 9 items.
- Graph labellings with variable weights, a survey (Q967309) (← links)
- \(L(j,k)\)-labeling numbers of square of paths (Q1680886) (← links)
- Algorithmic expedients for the \(S\)-labeling problem (Q2003435) (← links)
- Circular \(L(j,k)\)-labeling number of direct product of path and cycle (Q2444141) (← links)
- Recent progress in mathematics and engineering on optimal graph labellings with distance conditions (Q2471056) (← links)
- A survey on labeling graphs with a condition at distance two (Q2497501) (← links)
- \(L(1, 2)\)-edge-labelings for lattices (Q2514965) (← links)
- ODD GRACEFUL LABELINGS OF GRAPHS (Q3646208) (← links)
- <i>L</i>(1, 2)-labeling numbers on square of cycles (Q4956193) (← links)