Results 21 to 30 of about 9,014,600 (247)
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
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
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
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
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
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
Singed Total Domatic Number of a Graph [PDF]
, 2010 The maximum number of functions in a signed total dominating family on G is the signed total domatic number of G. In this paper, some properties related signed total domatic number and signed total domination number of a graph are studied and found the ...
Shailaja S. Shirkol +2 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 +2 more
openaire +3 more sources
, 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
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