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

DOI10.1002/NAV.20041MaRDI QIDQ4667824zbMATH OpenOpenAlexFDO

Authors Xiaohua Teresa Jin, Roger K. Yeh

Publication date 21 April 2005

Published in Naval Research Logistics (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

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

Recommendations

• Distance labellings of graphs
• Distance labeling in graphs
• Distance labeling in graphs (extended abstract)
• scientific article; zbMATH DE number 1500540
• Distance labeling schemes for well-separated graph classes
• Distance-two labelings of graphs
• scientific article; zbMATH DE number 1409224
• Distance Labeling for Permutation Graphs
• Distance compatible set-labeling of graphs
• Graph Labelings Derived from Models in Distributed Computing

Cited in

(10)

• \(L(j,k)\)-labeling numbers of square of paths
• Algorithmic expedients for the S-labeling problem
• New distance concept and graph theory approach for certain coding techniques design and analysis
• 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
• A survey on labeling graphs with a condition at distance two
• L(1, 2)-edge-labelings for lattices
• ODD GRACEFUL LABELINGS OF GRAPHS
• \(L(1, 2)\)-labeling numbers on square of cycles
• Graph labellings with variable weights, a survey

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4667824)