Results 11 to 20 of about 552,137 (300)
DOMINATION AND EDGE DOMINATION IN TREES [PDF]
Ural Mathematical Journal, 2020 Let \(G=(V,E)\) be a simple graph. A set \(S\subseteq V\) is a dominating set if every vertex in \(V \setminus S\) is adjacent to a vertex in \(S\). The domination number of a graph \(G\), denoted by \(\gamma(G)\) is the minimum cardinality of a dominating set of \(G\). A set \(D \subseteq E\) is an edge dominating set if every edge in \(E\setminus D\)
B. Senthilkumar +2 more
openaire +4 more sources
Domination versus edge domination [PDF]
Discrete Applied Mathematics, 2020 We propose the conjecture that the domination number $γ(G)$ of a $Δ$-regular graph $G$ with $Δ\geq 1$ is always at most its edge domination number $γ_e(G)$, which coincides with the domination number of its line graph. We prove that $γ(G)\leq \left(1+\frac{2(Δ-1)}{Δ2^Δ}\right)γ_e(G)$ for general $Δ\geq 1$, and $γ(G)\leq \left(\frac{7}{6}-\frac{1}{204 ...
Julien Baste +4 more
openaire +3 more sources
Impressions of dominance are made relative to others in the visual environment [PDF]
, 2014 Face judgments of dominance play an important role in human social interaction. Perceived facial dominance is thought to indicate physical formidability, as well as resource acquisition and holding potential. Dominance cues in the face affect perceptions
Carmen E. Lefevre +9 more
core +3 more sources
, 2017 Dominance describes the relative capacity of an individual (or group) to win an agonistic interaction with another animal/group. Differences in dominance rank emerge when ecological conditions force animals to compete over valuable, limited resources and
Bonaventura Majolo (17162617)
core +5 more sources
Dominating Sets and Domination Polynomials of Paths [PDF]
International Journal of Mathematics and Mathematical Sciences, 2009 Let G = (V, E) be a simple graph. A set S⊆V is a dominating set of G, if every vertex in V\S is adjacent to at least one vertex in S. Let be the family of all dominating sets of a path Pn with cardinality i, and let . In this paper, we construct , and obtain a recursive formula for d(Pn, i).
Saeid Alikhani, Yee-Hock Peng
openaire +3 more sources
The Electronic Journal of Combinatorics, 2012 In this paper, we propose a new network reliability measure for some particular kind of service networks, which we refer to as domination reliability. We relate this new reliability measure to the domination polynomial of a graph and the coverage probability of a hypergraph.
Klaus Dohmen, Peter Tittmann 0001
openaire +4 more sources
Information Dominance Center for Excellence [PDF]
, 2013 Includes topics such as: Mission, Vision, and What does Information Dominance mean?Navy Information Dominance optimizes all available information-based sensors, resources, and capabilities for maintaining an operational advantage at sea.
core +2 more sources
Domination and Fractional Domination in Digraphs
The Electronic Journal of Combinatorics, 2018 In this paper, we investigate the relation between the (fractional) domination number of a digraph $G$ and the independence number of its underlying graph, denoted by $\alpha(G)$. More precisely, we prove that every digraph $G$ on $n$ vertices has fractional domination number at most $2\alpha(G)$ and domination number at most $2\alpha(G) \cdot \log{n}$.
Harutyunyan, Ararat +3 more
openaire +6 more sources
DOMINATION AND REGULARITY [PDF]
The Bulletin of Symbolic Logic, 2020 AbstractWe discuss the close relationship between structural theorems in (generalized) stability theory, and graph regularity theorems.
openaire +3 more sources
Domination in functigraphs [PDF]
Discussiones Mathematicae Graph Theory, 2012 Let $G_1$ and $G_2$ be disjoint copies of a graph $G$, and let $f: V(G_1) \rightarrow V(G_2)$ be a function. Then a \emph{functigraph} $C(G, f)=(V, E)$ has the vertex set $V=V(G_1) \cup V(G_2)$ and the edge set $E=E(G_1) \cup E(G_2) \cup \{uv \mid u \in V(G_1), v \in V(G_2), v=f(u)\}$.
Linda Eroh +4 more
openaire +3 more sources