Yazar "Vaidya, Samir K." için listeleme
-
Congruent dominating sets in a graph - a new concept
Vaidya, Samir K.; Vadhel, Harshadkumar D. (Işık University Press, 2023-10)A dominating set D ? V (G) is said to be a congruent dominating set of G if ?v?V (G) d(v) ? 0 ( mod ?v?D d(v) ). The minimum cardinality of a minimal congruent dominating set of G is called the congruent domination number ... -
Domination integrity of total graphs
Vaidya, Samir K.; Shah, Nirav H. (Işık University Press, 2014)The domination integrity of a simple connected graph G is a measure of vulnerability of a graph. Here we determine the domination integrity of total graphs of path Pn, cycle Cn and star K1,n. -
Graphs with equal domination and independent domination number
Vaidya, Samir K.; Pandit, R. M. (Işık University Press, 2015)A set S of vertices of a graph G is an independent dominating set of G if S is an independent set and every vertex not in S is adjacent to a vertex in S. The independent domination number of G, denoted by i(G), is the ... -
Some results on total chromatic number of a graph
Vaidya, Samir K.; Isaac, Rakhimol V. (Işık University Press, 2017-08-24)A total coloring of a graph is a proper coloring in which no two adjacent or incident graph elements receive the same color. The total chromatic number of a graph is the smallest positive integer for which the graph admits ...
