Results 11 to 20 of about 1,785 (222)
Journal of New Theory, 2023 In this study, transformation graphs obtained from the concept of the total graph and the result of its paired domination number for some special graph families are discussed.
Hande Tunçel Gölpek
doaj +1 more source
Equitable and Paired Equitable Domination in Inflated Graphs and Their Complements
Axioms, 2023 Domination plays an indispensable role in graph theory. Various types of domination explore various types of applications. Equal-status people work together and interlace with each other easily.
Narayanan Kumaran +4 more
doaj +1 more source
Neighbourhood total domination in graphs [PDF]
Opuscula Mathematica, 2011 Let \(G = (V,E)\) be a graph without isolated vertices. A dominating set \(S\) of \(G\) is called a neighbourhood total dominating set (ntd-set) if the induced subgraph \(\langle N(S)\rangle\) has no isolated vertices.
S. Arumugam, C. Sivagnanam
doaj +1 more source
Edge subdivision and edge multisubdivision versus some domination related parameters in generalized corona graphs [PDF]
Opuscula Mathematica, 2016 Given a graph \(G=(V,E)\), the subdivision of an edge \(e=uv\in E(G)\) means the substitution of the edge \(e\) by a vertex \(x\) and the new edges \(ux\) and \(xv\).
Magda Dettlaff +2 more
doaj +1 more source
Total and paired domination numbers of toroidal meshes [PDF]
Journal of Combinatorial Optimization, 2012 Let $G$ be a graph without isolated vertices. The total domination number of $G$ is the minimum number of vertices that can dominate all vertices in $G$, and the paired domination number of $G$ is the minimum number of vertices in a dominating set whose induced subgraph contains a perfect matching.
Hu, Fu-Tao, Xu, Jun-Ming
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
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
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
Upper bounds on the paired-domination number
Applied Mathematics Letters, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Xue-gang +2 more
openaire +2 more sources