Ara
Toplam kayıt 3, listelenen: 1-3
Results on majority dom-chromatic sets of a graph
(Işık University Press, 2021)
A majority dominating set S ? V (G) is said to be majority dominating chromatic set if S satisfies the condition ?(hSi) = ?(G). The majority dom-chromatic number ?M?(G) is the minimum cardinality of majority dominating ...
Connected majority domination vertex critical graphs
(Işık University Press, 2021)
In this article, how the removal of a single vertex from a graph G can change the Connected Majority Domination number is surveyed for any graph G. A graph is Connected Domination Critical if the removal of any vertex ...
Results on the inverse majority domination and majority independence number of a graph
(Işık University Press, 2021)
In this article,the relationship between Inverse Majority Domination number ? ?1 M (G) and Majority Independence number ?M(G) of a graph G is discussed for some classes of graphs. In particular, ? ?1 M (G) and ?M(G) for ...