Search
Now showing items 1-4 of 4
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, ...
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, ...
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 ...
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 ...