In this paper we study the L ( 2 , 1 ) -labeling problem on oriented planar graphs providing some upper bounds on λ → . Then we focus on some specific ...
The L(2, 1)-labeling of a digraph D is a function l from the vertex set of D to the set of all nonnegative integers such that |l(x) − l(y)| ≥ 2 if x and y ...
In this paper we study the L(2,1)-labeling problem on oriented planar graphs with particular attention on the subclasses of oriented prisms, Halin and cactus.
Sep 29, 2019 · Prove that a simple planar graph has an orientation so that the in-degree of every node is at most 3. If the graph, in addition, is bipartite, ...
In this paper every undirected graph is a simple graph and every directed graph is an oriented graph, unless otherwise stated. There are two different oriented ...
In this paper we determine, or give lower and upper bounds on, the 2-dipath and oriented L(2, 1)-span of the family of planar graphs, planar graphs with girth 5 ...
In this paper we study the L(2,1)-labeling problem on oriented planar graphs providing some upper bounds on \vec{\lambda}. Then we focus on some specific ...
People also ask
How do you label a graph in graph theory?
How to identify a planar graph?
How do you draw a planar representation?
What is the rule of planar graph?
In this paper, p and q are non-negative integers. A k-L(p, q)-labeling of a graph G is a function ℓ from the vertex set V (G) to the set {0, 1, ...
In this paper we study the L(2, 1)-labeling problem on oriented planar graphs with particular attention on the subclasses of oriented prisms, ...
Dec 1, 2011 · In this paper, we improve the existing bounds [Calamoneri, T. and B. Sinaimeri, L ( 2 , 1 ) -Labeling of Oriented Planar Graphs (Extended ...