Given a graph G and a function h from E (G) to N, the h-subdivision of G, denoted by G (h), is
the graph obtained from G by replacing each edge uv in G with a path P: uxuv 1 xuv 2 …

Abstract An L (2, 1)-coloring (or labeling) of a graph G is a map** f: V (G) → Z^+ ⋃ {0\} f: V
(G)→ Z+⋃ 0 such that| f (u)-f (v)| ≥ 2| f (u)-f (v)|≥ 2 for all edges uv of G, and| f (u)-f (v)| ≥ 1| f …

Given a positive integer d, an L (d, 1)-labeling of a graph G is an assignment of nonnegative
integers to its vertices such that adjacent vertices must receive integers at least d apart, and …

Given a graph G and a function h from E (G) to N, the h-subdivision of G, denoted by G (h), is
the graph obtained from G by replacing each edge uv in G with a path P: uxuv 1 xuv 2 …

The spectrum allocation problem in wireless communications can be modeled through
vertex labelings of a graph, wherein each vertex represents a transmitter and edges connect …

Inspired by distance-constrained graph labelings that model the assignment of frequencies
to transmitters, we introduce a distance-constrained labeling of connected graphs that …

An L (2, 1)-coloring (or labeling) of a simple connected graph G is a map** 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 u and v are at …

Tato diplomová práce se zabývá L (p, q)-ohodnocením grafů a L (p, q, r)-ohodnocením
grafů. Příslušným ohodnocením rozumíme přiřazení nezáporných celých čísel vrcholům …

An L (2, 1)-labeling of a graph G is a function assigning a nonnegative integer to each vertex
such that adjacent vertices are labeled with integers differing by at least 2 and vertices at …

Two edges e 1 and e 2 in a graph G are said to be adjacent if they have a vertex in common,
and distance two apart if they are nonadjacent but both are adjacent to a common edge. An …