Search
Now showing items 1-3 of 3
On The Metric Dimension with Non-isolated Resolving Number of Some Exponential Graph
(Proceeding The 1st IBSC: Towards The Extended Use Of Basic Science For Enhancing Health, Environment, Energy And Biotechnology, 2017-08-08)
Let w, w ∈ G = (V, E). A distance in a simple, undirected and connected graph G, denoted by d(v, w), is the
length of the shortest path between v and w in G. For an ordered set W = {w1, w2, w3, . . . , wk} of vertices and ...
On the Rainbow Vertex Connection Number of Edge Comb of Some Graph
(Proceeding The 1st IBSC: Towards The Extended Use Of Basic Science For Enhancing Health, Environment, Energy And Biotechnology, 2017-08-08)
By an edge comb, we mean a graph formed by combining two graphs G and H, where each edge of graph G is
replaced by the which one edge of graph H, denote by G D H. A vertex colored graph G D H = (V (G D H), E(G D H)) ...
On the Metric-Location-Domination Number of Some Exponential Graphs
(The International Journal of Health, Education and Social (IJHES), 2019-11-30)
On the Metric-Location-Domination Number of Some Exponential Graphs