Graph distance‐dependent labeling related to code assignment in computer networks

DOI10.1002/nav.20041zbMath1063.05118OpenAlexW1999453570MaRDI QIDQ4667824

Xiaohua Teresa Jin, Roger K.-C. Yeh

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.20041

zbMATH Keywords

distancegraph labeling

Mathematics Subject Classification ID

Linear programming (90C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (9)

\(L(j,k)\)-labeling numbers of square of paths ⋮ Circular \(L(j,k)\)-labeling number of direct product of path and cycle ⋮ Recent progress in mathematics and engineering on optimal graph labellings with distance conditions ⋮ Algorithmic expedients for the \(S\)-labeling problem ⋮ Graph labellings with variable weights, a survey ⋮ A survey on labeling graphs with a condition at distance two ⋮ L(1, 2)-labeling numbers on square of cycles ⋮ \(L(1, 2)\)-edge-labelings for lattices ⋮ ODD GRACEFUL LABELINGS OF GRAPHS

Cites Work

• Unnamed Item

This page was built for publication: Graph distance‐dependent labeling related to code assignment in computer networks