𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Labeling Planar Graphs with Conditions on Girth and Distance Two

✍ Scribed by Wang, Wei-Fan; Lih, Ko-Wei


Book ID
118199528
Publisher
Society for Industrial and Applied Mathematics
Year
2003
Tongue
English
Weight
168 KB
Volume
17
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


On the size of graphs labeled with a con
✍ Georges, John P.; Mauro, David W. πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 595 KB

A labeling of graph G with a condition at distance two is an integer labeling of V(G) such that adjacent vertices have labels that differ by at least two, and vertices distance two apart have labels that differ by a t least one. The lambda-number of G, A(G), is the minimum span over all labelings of