Geodomination in graphs II
Adel P. Kazemi · Journal of Discrete Mathematical Sciences and Cryptography · 2009
In this paper after defining two new concepts open independent geodomination and open independent k-geodomination numbers for a graph G, denoted by oig(G), oigk (G), respectively, we state some results for graphs and the cartesian product of them. Finally we prove that for some integers k, N there exist a connected graph T with diameter at least k and a graph G such that G is obtained from T by adding a vertex v with more than one edge incident with v such that |igk (T) − igk (G)| = N and |oigk (T) − oigk (G)| = N.