Ara
Toplam kayıt 2, listelenen: 1-2
Graphs with equal domination and independent domination number
(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 ...
Congruent dominating sets in a graph - a new concept
(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 ...