Results 41 to 50 of about 2,093,493 (279)
γ-Paired dominating graphs of lollipop, umbrella and coconut graphs
A paired dominating set of a graph G is a dominating set whose induced subgraph has a perfect matching. The paired domination number γpr(G) of G is the minimum cardinality of a paired dominating set. A paired dominating set D is a γpr(G)-set if |D|=γpr(G)
Pannawat Eakawinrujee +1 more
doaj +1 more source
Neighbourhood total domination in graphs [PDF]
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
On Paired Domination of Some Graphs
For a graph a subset D of the vertex set is called a dominating set if every vertex in is adjacent to some vertex in D. The domination number is the minimum cardinality of a dominating set of a graph G.
Rakhimol V. Isaac, Parashree Pandya
semanticscholar +1 more source
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 +3 more sources
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
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paul N. Balister, Béla Bollobás
openaire +1 more source
The architecture of differences
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
Graphical Analysis of Covering and Paired Domination in the Environment of Neutrosophic Information
Neutrosophic graph (NG) is a powerful tool in graph theory, which is capable of modeling many real-life problems with uncertainty due to unclear, varying, and indeterminate information.
S. Khan, A. Nasir, N. Jan, Zhenhua Ma
semanticscholar +1 more source
Heritability and growth analysis of Brant`s oak (Quercus brantii Lindl.) based on sapling characteristics [PDF]
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
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

