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