Results 21 to 30 of about 9,482,744 (249)

The Forcing Domination Number of Hamiltonian Cubic Graphs [PDF]

, 2009
The authors presented a sequence of Hamiltonian cubic graphs whose domination numbers are sharp and in this paper we study forcing domination number for those ...
H. Abdollahzadeh Ahangar, H.Abdollahzadeh Ahangar, Abdollahzadeh Ahangar, H., Pushpalatha L.   +3 more
core   +1 more source

Total and paired domination stability in prisms [PDF]

, 2023
A set $D$ of vertices in an isolate-free graph is a total dominating set if every vertex is adjacent to a vertex in $D$. If the set $D$ has the additional property that the subgraph induced by $D$ contains a perfect matching, then $D$ is a paired ...
Michael A. Henning, Tumidajewicz, Elżbieta, Monika Pilśniak, Elżbieta Tumidajewicz, Pilśniak, Monika, Gorzkowska, Aleksandra, Aleksandra Gorzkowska, Henning, Michael A.   +7 more
core   +1 more source

Heritability and growth analysis of Brant`s oak (Quercus brantii Lindl.) based on sapling characteristics [PDF]

تحقیقات جنگل و صنوبر ایران, 2018
Brant`s oak (Quercus brantii Lindl.) is one of the most important tree species of Zagros forests. The major objective of the study was to assess various populations of the species for identification of plus tree individuals and growth trend analysis of ...
Hossein Mirzaie-Nodoushan, Jafar Hosseinzadeh, Mehdi Pourhashemi, Shahin Mehrpur, Mojtaba Hamzehpour, Zahra Abravesh   +5 more
doaj   +1 more source

Upper bounds on the paired-domination number

Applied Mathematics Letters, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xue-Gang Chen, Wai Chee Shiu, Wai Hong Chan   +2 more
openaire   +3 more sources

Twin Paired Domination number of a graph

Journal of Physics: Conference Series, 2020
Abstract A new domination papramter “Twin paired domination number” is introduced in this paper. The set S ⊆ V
G. Mahadevan, M. Vimala Suganthi
openaire   +1 more source

Triple Connected Domination Number of a Graph [PDF]

, 2012
The concept of triple connected graphs with real life application was introduced by considering the existence of a path containing any three vertices of a graph G.
Selvam Avadayappan, T.Subramanian, Joseph, Paulraj, J.Paulraj Joseph, G.Mahadevan, Avadayappan, Selvam, Subramanian, T., Mahadevan, G.   +7 more
core   +1 more source

Paired-domination number of a graph and its complement

Discrete Mathematics, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Odile Favaron, Hossein Karami 0002, Seyed Mahmoud Sheikholeslami   +2 more
openaire   +3 more sources

Paired-domination in graphs [PDF]

, 2013
D.Phil. (Mathematics)Domination and its variants are now well studied in graph theory. One of these variants, paired-domination, requires that the subgraph induced by the dominating set contains a perfect matching.
McCoy, John Patrick
core   +1 more source

Paired-domination game played in graphs [PDF]

Communications in Combinatorics and Optimization, 2019
In this paper, we continue the study of the domination game in graphs introduced by Bre{\v{s}}ar, Klav{\v{z}}ar, and Rall [SIAM J. Discrete Math. 24 (2010) 979--991].
T.W. Haynes, Michael A. Henning
doaj  

The Paired Domination Number of Cubic Graphs

, 2020
Let G be a simple undirected graph with no isolated vertex. A paired dominating set of G is a dominating set which induces a subgraph that has a perfect matching. The paired domination number of G, denoted by γpr(G), is the size of its smallest paired dominating set. Goddard and Henning conjectured that γpr(G) {\leq} 4n/7 holds for every graph G with δ(
Sheng, Bin, Lu, Changhong
openaire   +2 more sources