Results 21 to 30 of about 9,063,667 (65)
Perfect Domination Excellent Trees [PDF]
A set D of vertices of a graph G is a perfect dominating set if every vertex in V \ D is adjacent to exactly one vertex in D. In this paper we introduce the concept of perfect domination excellent graph as a graph in which every vertex belongs to some ...
Sharada, B., Sharada B.
core +1 more source
The Slater and Sub-k-Domination Number of a Graph with Applications to Domination and k-Domination [PDF]
In this paper we introduce and study a new graph invariant derived from the degree sequence of a graph G, called the sub-k-domination number and denoted subk(G).
Asplund, John +3 more
core +2 more sources
summary:For a graphical property $\mathcal{P}$ and a graph $G$, a subset $S$ of vertices of $G$ is a $\mathcal{P}$-set if the subgraph induced by $S$ has the property $\mathcal{P}$. The domination number with respect to the property $\mathcal{P}$, is the
Samodivkin, Vladimir +9 more
core +1 more source
Strong weak domination and domination balance in a graph [PDF]
summary:In this paper we extend the notion of weak degree domination in graphs to hypergraphs and find relationships among the domination number, the weak edge-degree domination number, the independent domination number and the independence number of a ...
B.D. Acharya +4 more
core +1 more source
Edge domination in graphs of cubes [PDF]
summary:The signed edge domination number and the signed total edge domination number of a graph are considered; they are variants of the domination number and the total domination number.
Zelinka, Bohdan +3 more
core +1 more source
Signed and minus domination in bipartite graphs [PDF]
summary:The paper studies the signed domination number and the minus domination number of the complete bipartite graph $K_{p, q}$
Zelinka, Bohdan
core +1 more source
For a finite undirected graph G on n vertices two continuous optimization problems taken over the n-dimensional cube are presented and it is proved that their optimum values equal the domination number γ of G.
Harant, Jochen, Göring, Frank
core +2 more sources
On the $2$-domination number of cylinders with small cycles [PDF]
Domination-type parameters are difficult to manage in Cartesian productgraphs and there is usually no general relationship between the parameter inboth factors and in the product graph.
Puertas, M. L. +15 more
core +1 more source
SIGNED 2-DOMINATION IN CATERPILLARS [PDF]
summary:A caterpillar is a tree with the property that after deleting all its vertices of degree 1 a simple path is obtained. The signed 2-domination number $\gamma ^2_{\mathrm s}(G)$ and the signed total 2-domination number $\gamma ^2_{\mathrm {st}}(G)$
Zelinka, Bohdan, Bohdan Zelinka
core +1 more source
This thesis comprises the results of five research papers on domination and zero forcing. In "Largest Domination Number and Smallest Independence Number of Forests with given Degree Sequence" (Gentner, Henning, Rautenbach, 2016) and "Smallest Domination
Gentner, Michael
core +1 more source

