Results 71 to 80 of about 11,572,072 (152)

Outer independent $\{2\}$-domination in trees

An outer independent $\{2\}$-dominating function (OI$\{2\}$D-function) of a graph $G$ is a function $f:V(G)\longrightarrow\{0,1,2\}$ such that no two vertices assigned 0 under $f$ are adjacent, and $f(N[v])\geq2$ for all $v\in V(G),$ where $N[v]$ stands ...
M. Chellali, Seyed Mahmoud Sheikholeslami, Jafar Amjadi, M. Esmaeiliyan   +3 more
core   +1 more source

Perfect graphs of strong domination and independent strong domination

, 2005
Let γ(G), i(G), γS(G) and iS(G) denote the domination number, the independent domination number, the strong domination number and the independent strong domination number of a graph G, respectively.
D. Rautenbach, V. E. Zverovich
core  

Independent domination versus packing in subcubic graphs

In 2011, Henning, Louml;wenstein, and Rautenbach observed that the domination number of a graph is bounded above by the product of the packing number and the maximum degree of the graph.
Cho Eun-Kyung, Kim Minki
core   +1 more source

Domination Number in Neutrosophic Soft Graphs

, 2019
The soft set theory is a mathematical tool to represent uncertainty, imprecise, and vagueness is often employed in solving decision making problem.
Florentin Smarandache, S. Satham Hussain, R. Jahir Hussain   +2 more
core   +1 more source

Independent [1,2]-number versus independent domination number

A [1, 2]-set S in a graph G is a vertex subset such that every vertex not in S has at least one and at most two neighbors in it. If the additional requirement that the set be independent is added, the existence of such sets is not guaranteed in every ...
Aleid, Sahar A., Puertas González, María Luz, Mora Giné, Mercè   +2 more
core  

On the Independent Domination Number of Random Regular Graphs

, 2003
A dominating set D of a graph G is a subset of V (G) such that for every vertex v ∈ V (G), either in v ∈ D or there exists a vertex u ∈ D that is adjacent to v. We are interested in finding dominating sets of small cardinality.
W. Duckworth, N. C. Wormald
core  

Robustness asymmetry under edge failures: A unified framework based on structural controllability and power domination. [PDF]

PLoS One
Alwasel B.
europepmc   +1 more source

Fault-tolerance amplification in line graphs: a framework for resilient PMU placement in power networks. [PDF]

Sci Rep
Girish L, Asiri A, Somasundaram K.
europepmc   +1 more source

Weaponizing the digital divide: a Weberian analysis of elite domination in Indonesia political contestation. [PDF]

Front Sociol
Prayoga RA, Tantri E, Wicaksono A, Wahyono E, Wibowo DP, Pamungkas C, Setyaningsih RP, Indriasari DT.   +7 more
europepmc   +1 more source

1-Movable Independent Domination in Graphs

, 2015
access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Renario G. Hinampas, Sergio R. Canoy
core