Ara
Toplam kayıt 3, listelenen: 1-3
Vulnerability in networks
(Işık University Press, 2019)
Recently defined exponential domination number is reported as a new measure to graph vulnerability. It is a methodology, emerged in graph theory, for vulnerability analysis of networks. Also, it gives more sensitive results ...
Exponential domination of tree related graphs
(Işık University Press, 2019)
The well-known concept of domination in graphs is a good tool for analyzing situations that can be modeled by networks. Although a vertex in the graph can exert influence on, or dominate, all vertices in its immediate ...
Chromatic weak domatic partition in graphs
(Işık University Press, 2019)
In a simple graph G, a subset D of V (G) is called a chromatic weak dominating set if D is a weak dominating set and χ(< D >) = χ(G). Similar to domatic partition, chromatic weak domatic partition can be defined. The maximum ...