Ara
Toplam kayıt 12, listelenen: 1-10
On the average lower 2-domination number of a graph
(Işık University Press, 2019)
Computer scientists and network scientists want a speedy, reliable, and nonstop communication. In a communication network, the vulnerability measures the resistance of the network to disruption of operation after the failure ...
Algorithmic complexity of isolate secure domination in graphs
(Işık University Press, 2021)
A dominating set S is an Isolate Dominating Set (IDS) if the induced subgraph G[S] has at least one isolated vertex. In this paper, we initiate the study of new domination parameter called, isolate secure domination. An ...
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 ...
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 ...
On total vertex-edge domination
(Işık University Press, 2019)
In this paper we obtain an improved upper bound of total vertex edgedomination number of a tree. If T is a connected tree with order n, then γͭᵥₑ(T) ≤ m/3 with m = 6[ n/6] and we characterize the trees attaining this upper ...
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 ...
Disjunctive total domination in some graphs derived from the subdivision graph
(Işık University Press, 2021)
For a set S ⊆ V (G), if every vertex has a neighbor in S or has at least two vertices in S at distance two from it, then the set S is a disjunctive total dominating set of G. The minimum cardinality of such a set is equal ...
Outer-convex domination in the corona of graphs
(Işık University Press, 2022)
Let G be a connected simple graph. A subset S of a vertex set V (G) is called an outer-convex dominating set of G if for every vertex v ∈ V (G)\S, there exists a vertex x ∈ S such that xv is an edge of G and V (G)\S is a ...
Contraction and domination in fuzzy graphs
(Işık University Press, 2023-01)
Fuzzy sets and logics is a true crowning achievement of the century. Among the variety of exemplary changes in science and technology, the concept of uncertainty played a significant role, which led to the development of ...