Fractional dominations and fractional total dominations of graph complements
نویسندگان
چکیده
منابع مشابه
Fundamental Dominations in Graphs
Nine variations of the concept of domination in a simple graph are identified as fundamental domination concepts, and a unified approach is introduced for studying them. For each variation, the minimum cardinality of a subset of dominating elements is the corresponding fundamental domination number. It is observed that, for each nontrivial connected graph, at most five of these nine numbers can...
متن کاملLinking Dominations and Signatures in Network Reliability
Comparing the reliability of two networks of more than modest size can be a computationally intensive exercise. In this paper, domination theory and the notion of the signature of a network, and their respective roles in calculating the reliability of a network, are briefly reviewed. The computational advantages of the former, and the interpretive richness of the latter, beg the question: how a...
متن کاملOn Perfect and Quasiperfect Dominations in Graphs∗
A subset S ⊆ V in a graph G = (V,E) is a k-quasiperfect dominating set (for k ≥ 1) if every vertex not in S is adjacent to at least one and at most k vertices in S. The cardinality of a minimum k-quasiperfect dominating set in G is denoted by γ 1k (G). Those sets were first introduced by Chellali et al. (2013) as a generalization of the perfect domination concept and allow us to construct a dec...
متن کاملThe bondage numbers and efficient dominations of vertex-transitive graphs
The bondage number of a graph G is the minimum number of edges whose removal results in a graph with larger domination number.A dominating setD is called an efficient dominating set ofG if |N−[v]∩D|=1 for every vertex v ∈ V (G). In this paper we establish a tight lower bound for the bondage number of a vertex-transitive graph. We also obtain upper bounds for regular graphs by investigating the ...
متن کاملDomination number of graph fractional powers
For any $k in mathbb{N}$, the $k$-subdivision of graph $G$ is a simple graph $G^{frac{1}{k}}$, which is constructed by replacing each edge of $G$ with a path of length $k$. In [Moharram N. Iradmusa, On colorings of graph fractional powers, Discrete Math., (310) 2010, No. 10-11, 1551-1556] the $m$th power of the $n$-subdivision of $G$ has been introduced as a fractional power of $G$, denoted by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2002
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(01)00305-5