Results 21 to 30 of about 2,114 (237)
Discussiones Mathematicae Graph Theory, 1998 It is known that a dominating set \(S\) of vertices of a graph \(G\) is a set such that every vertex of \(G\) is either in \(S\) or adjacent to at least one member of \(S\). A paired-dominating set is a dominating set whose induced subgraph contains at least one perfect matching.
Shannon L. Fitzpatrick, Bert L. Hartnell
openaire +4 more sources
Block Graphs with Large Paired Domination Multisubdivision Number
Discussiones Mathematicae Graph Theory, 2021 The paired domination multisubdivision number of a nonempty graph G, denoted by msdpr(G), is the smallest positive integer k such that there exists an edge which must be subdivided k times to increase the paired domination number of G.
Mynhardt Christina M., Raczek Joanna
doaj +1 more source
Paired-domination in inflated graphs
Theoretical Computer Science, 2004 The paper studies inflated graphs of graphs. If \(G\) is a graph, then the inflated graph \(G_I\) of \(G\) is defined. It is obtained from \(G\) by replacing each vertex \(x\) of \(G\) by a clique with the number of vertices equal to the degree of \(x\) in \(G\) and replacing each edge between two vertices by an edge joining vertices of these cliques ...
Liying Kang +2 more
openaire +4 more sources
European Journal of Combinatorics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paul N. Balister, Béla Bollobás
openaire +2 more sources
Total and paired domination stability in prisms
Discussiones Mathematicae Graph Theory, 2023 Summary: 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 dominating set of \(G\).
Aleksandra Gorzkowska +3 more
openaire +2 more sources
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 architecture of differences
Techne, 2021 Following in the footsteps of the protagonists of the Italian architectural debate is a mark of culture and proactivity. The synthesis deriving from the artistic-humanistic factors, combined with the technical-scientific component, comprises the very ...
Emilio Faroldi
doaj +1 more source
Graphs With Large Semipaired Domination Number
Discussiones Mathematicae Graph Theory, 2019 Let G be a graph with vertex set V and no isolated vertices. A sub-set S ⊆ V is a semipaired dominating set of G if every vertex in V \ S is adjacent to a vertex in S and S can be partitioned into two element subsets such that the vertices in each subset
Haynes Teresa W., Henning Michael A.
doaj +1 more source
Total Domination Versus Paired-Domination in Regular Graphs
Discussiones Mathematicae Graph Theory, 2018 A subset S of vertices of a graph G is a dominating set of G if every vertex not in S has a neighbor in S, while S is a total dominating set of G if every vertex has a neighbor in S. If S is a dominating set with the additional property that the subgraph
Cyman Joanna +4 more
doaj +1 more source