Results 31 to 40 of about 135,416 (202)

Acyclic domination [PDF]

, 1988
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, Mynhardt, Christina M., Samodivkin, Vladmir, Henning, Michael A., Chinn, Phyllis Z., Dutton, Ronald D., Brigham, Robert C., S.M. Hedetniemi, S.T. Hedetniemi, D.F. Rall   +9 more
core   +1 more source

On domination in graphs [PDF]

, 2005
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

Inequalities involving independence domination, $f$-domination, connected and total $f$-domination numbers [PDF]

, 2000
summary:Let $f$ be an integer-valued function defined on the vertex set $V(G)$ of a graph $G$. A subset $D$ of $V(G)$ is an $f$-dominating set if each vertex $x$ outside $D$ is adjacent to at least $f(x)$ vertices in $D$.
Wei, Bing, Muthammai, S., Zhou, Sanming, Janakiraman, T. N., Wang, Shaohui, Bhanumathi, M., Robert B. Allan, Renu Laskar   +7 more
core   +1 more source

SIGNED 2-DOMINATION IN CATERPILLARS [PDF]

, 2003
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

Restrained roman domination in graphs [PDF]

Transactions on Combinatorics, 2015
A Roman dominating function (RDF) on a graph G = (V,E) is defined to be a function satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2. A set S V is a Restrained dominating set if every
Roushini Leely Pushpam , Padmapriea Sampath   +1 more
doaj  

The Number of Minimum Dominating Sets in Pn × P2 [PDF]

, 2010
A set S of vertices in a graph G is said to be a Smarandachely k-dominating set if each vertex of G is dominated by at least k vertices of S.
Kishori P. Narayankar, Shirakol, Shailaja S., Shailaja S. Shirakol, H.B.Walikar, Narayankar, Kishori P., H. B. Walikar   +5 more
core   +1 more source

In Palantir we trust? Regulation of data analysis platforms in public security

Big Data & Society
Organizations increasingly rely on digital technologies to perform tasks. To do so, they have to integrate data banks to make the data usable. We argue that there is a growing, academically underexplored market consisting of data integration and analysis
Lena Ulbricht, Simon Egbert
doaj   +1 more source

Survey on Roman {2}-Domination

Mathematics
The notion of Roman {2}-domination was introduced in 2016 as a variant of Roman domination, a concept inspired by a defending strategy used by the emperor Constantine (272–337 AD) to protect the Roman Empire.
Ahlam Almulhim, Bana Al Subaiei, Saiful Rahman Mondal   +2 more
doaj   +1 more source

Bridging the Loneliness Gap: Depression, Connectivity, and Isolation in Pediatric Oncology Patients and Their Peers

Pediatric Blood &Cancer, EarlyView.
ABSTRACT Background Loneliness is associated with adverse physical and mental health outcomes and remains understudied in children and adolescents undergoing cancer therapy. Pediatric oncology patients may be at increased risk due to medical isolation and disruption of social networks.
Charlotte N. Stahlfeld, Scott H. Maurer, Michelle D. Watkinson, John Nury, Elise Barberis, Molly C. Mack   +5 more
wiley   +1 more source

Signed and minus domination in bipartite graphs [PDF]

, 2006
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