๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Labeling Planar Graphs without 4,5-Cycles with a Condition on Distance Two

โœ Scribed by Zhu, Hai-Yang; Lu, Xin-Zhong; Wang, Cui-Qi; Chen, Ming

Book ID
118197145
Publisher
Society for Industrial and Applied Mathematics
Year
2012
Tongue
English
Weight
609 KB
Volume
26
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
On the size of graphs labeled with a condition at distance two
โœ 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