Currently displaying 1 – 1 of 1

Showing per page

Order by Relevance | Title | Year of publication

Solutions of Some L(2, 1)-Coloring Related Open Problems

Nibedita MandalPratima Panigrahi — 2016

Discussiones Mathematicae Graph Theory

An L(2, 1)-coloring (or labeling) of a graph G is a vertex coloring f : V (G) → Z+ ∪ {0} such that |f(u) − f(v)| ≥ 2 for all edges uv of G, and |f(u)−f(v)| ≥ 1 if d(u, v) = 2, where d(u, v) is the distance between vertices u and v in G. The span of an L(2, 1)-coloring is the maximum color (or label) assigned by it. The span of a graph G is the smallest integer λ such that there exists an L(2, 1)-coloring of G with span λ. An L(2, 1)-coloring of a graph with span equal to the span of the graph is...

Page 1

Download Results (CSV)