Search
Now showing items 11-20 of 26
The non-isolated resolving number of k-corona product of graphs
(2018-07-04)
Let all graphs be a connected and simple graph. A set W = fw
g
of veretx set of G, the kvector ordered r(vjW) = (d(x; w
1
); d(x; w
2
1
; w
2
); : : : ; d(x; w
)) of is a
representation of v with respect to W, ...
Several classes of graphs and their r-dynamic chromatic numbers
(2018-02-28)
Let G be a simple, connected and undirected graph. Let r; k be natural
numbers. By a proper k-coloring of a graph G, we mean a map c : V (G) ! S, where
jSj = k, such that any two adjacent vertices receive di erent colors. ...
On the total H-irregularity strength of graphs: A new notion
(2018-02-28)
A total edge irregularity strength of G has been already widely studied in many
papers. The total -labeling is said to be a total edge irregular -labeling of the graph G if for
every two di erent edges e
1
and e
2
, ...
On the local edge antimagicness of m-splitting graphs
(2018-07-03)
Let G be a connected and simple graph. A split graph is a graph derived by adding
new vertex v
0
in every vertex v such that v
0
adjacent to v in graph G. An m-splitting graph
is a graph which has m v
0
-vertices, ...
The Connected and Disjoint Union of Semi Jahangir Graphs Admit a Cycle-Super (a, d)-Atimagic Total Labeling
(2018-02-28)
We assume that all graphs in this paper are finite, undirected and no loop and multiple
edges. Given a graph G of order p and size q.LetH
,H be subgraphs of G.ByH
-covering,
we mean every edge in E(G) belongs to at ...
On Rainbow k-Connection Number of Special Graphs and It's Sharp Lower Bound
(2018-02-28)
Let G = (V; E) be a simple, nontrivial, nite, connected and undirected
graph. Let c be a coloring c : E(G) ! f1; 2; : : : ; sg; s 2 N. A path of edge colored
graph is said to be a rainbow path if no two edges on the ...
On locating independent domination number of amalgamation graphs
(2018-02-28)
An independent set or stable set is a set of vertices in a graph in which no two
of vertices are adjacent. A set D of vertices of graph G is called a dominating set if every
vertex u 2 V (G) ¡ D is adjacent to some vertex ...
On the total rainbow connection of the wheel related graphs
(2018-07-04)
Let G = (V (G); E(G)) be a nontrivial connected graph with an edge coloring
c : E(G) ! f1; 2; :::; lg; l 2 N, with the condition that the adjacent edges may be colored by
the same colors. A path P in G is called rainbow ...
On r-dynamic coloring of some graph operations
(2018-03-07)
Let G be a simple, connected and undirected graph. Given r; k as any natural numbers. By an
r-dynamic k-coloring of graph G, we mean a proper k-coloring c(v) of G such that jc(N(v))j
minfr; d(v)g for each vertex v in ...
Bound of Distance Domination Number of Graph and Edge Comb Product Graph
(2017-09-11)
Let G =(V, E) be a simple, nontrivial, finite, connected and undirected graph. For
an integer 1 k diam(G), a distance k-dominating set of a connected graph G is a set S of
vertices of G such that every vertex of V ...