Results 31 to 40 of about 460,855 (251)
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
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
Complexity of Paired Domination in AT-free and Planar Graphs [PDF]
SSRN Electronic Journal, 2022 For a graph $G=(V,E)$, a subset $D$ of vertex set $V$, is a dominating set of $G$ if every vertex not in $D$ is adjacent to atleast one vertex of $D$. A dominating set $D$ of a graph $G$ with no isolated vertices is called a paired dominating set (PD-set), if $G[D]$, the subgraph induced by $D$ in $G$ has a perfect matching. The Min-PD problem requires
Vikash Tripathi +4 more
openaire +5 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
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
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
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
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
Hereditary dominating pair graphs
Discrete Applied Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Natasa Przulj +2 more
openaire +3 more sources
Perfect Domination Excellent Trees [PDF]
, 2012 A set D of vertices of a graph G is a perfect dominating set if every vertex in V \ D is adjacent to exactly one vertex in D. In this paper we introduce the concept of perfect domination excellent graph as a graph in which every vertex belongs to some ...
Sharada, B., Sharada B.
core +1 more source