Results 271 to 280 of about 11,106,432 (291)

Independent Domination Number of Planar Triangulations

Journal of Graph Theory
ABSTRACTWe show that every planar triangulation on vertices has a maximal independent set of size at most . This affirms a conjecture by Botler, Fernandes, and Gutiérrez (Electron. J. Comb., 2024) based on an open question of Goddard and Henning (Appl. Math. Comput., 2020).
P. Francis, Abraham M. Illickan, Lijo M. Jose, Deepak Rajendraprasad   +3 more
openaire   +2 more sources

On the Independent Domination Number of Random Regular Graphs

Combinatorics, Probability and Computing, 2006
A dominating set $\cal D$ of a graph $G$ is a subset of $V(G)$ such that, for every vertex $v\in V(G)$, either in $v\in {\cal D}$ or there exists a vertex $u \in {\cal D}$ that is adjacent to $v$. We are interested in finding dominating sets of small cardinality. A dominating set $\cal I$ of a graph $G$ is said to be independent if no two vertices of ${
William Duckworth, Nicholas C. Wormald
openaire   +2 more sources

Domination number, independent domination number and k-independence number in trees

Discrete Applied Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Qing Cui, Xu Zou
openaire   +3 more sources

On three outer-independent domination related parameters in graphs

Discrete Applied Mathematics, 2021
Doost Ali Mojdeh, Ismael G Yero, Iztok Peterin   +2 more
exaly  

On the independent domination polynomial of a graph

Discrete Applied Mathematics, 2021
Saeid Alikhani, Somayeh Jahari
exaly  

Graphs with Equal Domination and Independent Domination Number

A set S of vertices of a graph G is an independent dominating set of G ifS is an independent set and every vertex not in S is adjacent to a vertex in S. Theindependent domination number of G, denoted by i G , is the minimum cardinality ofan independent dominating set of G.
VAİDYA, S. K., PANDİT, R. M.
openaire   +1 more source

On graphs with equal domination and edge independence numbers

Ars Comb., 1995
Let \(d(G)\) be the dominating number of a graph \(G\), and \(\alpha(G)\) be the edge independence number of \(G\), i.e. the maximum size of a matching in \(G\). The author characterizes regular graphs, unicyclic graphs, block graphs, and locally connected graphs with \(d(G)= \alpha(G)\).
openaire   +2 more sources

Domination and Independent Domination in Hexagonal Systems

Mathematics, 2022
Pawaton Kaemawichanurat
exaly  

Domination, Independent Domination and $k$-independence in Trees

Taiwanese Journal of Mathematics, 2022
Baoyindureng Wu
exaly  

Domination versus independent domination in cubic graphs

Discrete Mathematics, 2013
Michael Henning, Justin Southey
exaly