Results 31 to 40 of about 318,369 (260)

Edge subdivision and edge multisubdivision versus some domination related parameters in generalized corona graphs [PDF]

open access: yesOpuscula 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

γ-Paired dominating graphs of lollipop, umbrella and coconut graphs

open access: yesElectronic Journal of Graph Theory and Applications, 2023
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]

open access: yesOpuscula 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

Paired-domination

open access: yesDiscussiones 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   +3 more sources

Pair dominating graphs

open access: yesEuropean Journal of Combinatorics, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paul N. Balister, Béla Bollobás
openaire   +1 more source

A Novel Description of Some Concepts in Interval-Valued Intuitionistic Fuzzy Graph with an Application

open access: yesAdvances 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

The architecture of differences

open access: yesTechne, 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]

open access: yesتحقیقات جنگل و صنوبر ایران, 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

Perfect Domination Excellent Trees [PDF]

open access: yes, 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

Graphs With Large Semipaired Domination Number

open access: yesDiscussiones 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

Home - About - Disclaimer - Privacy