Results 21 to 30 of about 9,482,745 (250)
Advances in Mathematical Physics, 2022 Covering, matching, and domination are the basic concepts in graphs that play a decisive role in the properties of graphs. Calculating these parameters is one of the difficulties in fuzzy graphs when it is not possible to accurately determine the values ...
Xiaoli Qiang +5 more
doaj +1 more source
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 +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 +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 +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 +2 more
openaire +3 more sources
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 +7 more
core +1 more source
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
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
, 2020 A set S of vertices in a graph G is a paired dominating set if every vertex of G is adjacent to a vertex in S and the subgraph induced by S contains a perfect matching (not necessarily as an induced subgraph).
Haynes, Teresa W. +5 more
core +1 more source