Infinitely Many Trees with Maximum Number of Holes Zero, One, and Two

An L(2,1)-coloring of a simple connected graph G is an assignment f of nonnegative integers to the vertices of G such that fu-fv⩾2 if d(u,v)=1 and fu-fv⩾1 if d(u,v)=2 for all u,v∈V(G), where d(u,v) denotes the distance between u and v in G. The span of f is the maximum color assigned by f. The span...

Full description

Saved in:
Bibliographic Details
Main Authors: Srinivasa Rao Kola, Balakrishna Gudla, P. K. Niranjan
Format: Article
Language:English
Published: Wiley 2018-01-01
Series:Journal of Applied Mathematics
Online Access:http://dx.doi.org/10.1155/2018/8186345
Tags: Add Tag
No Tags, Be the first to tag this record!