Results 31 to 40 of about 460,858 (257)

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   +2 more sources

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

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

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

Forecasting the Dialysis Burden in Japan: Validation‐Based Projections of Prevalence and Incidence Through 2050

open access: yesTherapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Background Japan has one of the highest dialysis prevalence rates worldwide and a shrinking, aging population. Whether dialysis burden has entered a sustained post‐peak phase or whether recent declines partly reflect pandemic‐related disruptions remains uncertain.
Hatice Şahin   +2 more
wiley   +1 more source

Calpain small subunit homodimerization is robust and calcium‐independent

open access: yesFEBS Letters, EarlyView.
Calpains dimerize via penta‐EF‐hand (PEF) domains. Using single‐molecule force spectroscopy, we measured the strength and kinetics of PEF–PEF homodimer binding. The interaction is robust, shows a transient conformational step before dissociation, and remains largely insensitive to Ca2+.
Nesha May O. Andoy   +4 more
wiley   +1 more source

Performance of binary accelarator system on natural rubber compound

open access: yesMajalah Kulit, Karet, dan Plastik, 2018
Accelerator system provides different response onto the rubber compound, and in turn influences its final properties. Accelerators, such as 2,2'-Dithiobis (benzothiazole) (MBTS), N-Cyclohexylbenzothiazole-2-Sulfenamide (CBS) and diphenyl guanidine (DPG),
Ihda Novia Indrajati, Indiah Ratna Dewi
doaj   +1 more source

Disjoint Paired-Dominating sets in Cubic Graphs [PDF]

open access: yesGraphs and Combinatorics, 2019
A paired-dominating set of a graph G is a dominating set D with the additional requirement that the induced subgraph G[D] contains a perfect matching. We prove that the vertex set of every claw-free cubic graph can be partitioned into two paired-dominating sets.
Gábor Bacsó   +3 more
openaire   +5 more sources

Home - About - Disclaimer - Privacy