Results 31 to 40 of about 9,014,600 (248)

Paired-domination game played in graphs [PDF]

Communications in Combinatorics and Optimization, 2019
In this paper, we continue the study of the domination game in graphs introduced by Bre{\v{s}}ar, Klav{\v{z}}ar, and Rall [SIAM J. Discrete Math. 24 (2010) 979--991].
T.W. Haynes, Michael A. Henning
doaj  

Twin Paired Domination number of a graph

Journal of Physics: Conference Series, 2020
Abstract A new domination papramter “Twin paired domination number” is introduced in this paper. The set S ⊆ V
G. Mahadevan, M. Vimala Suganthi
openaire   +1 more source

The Number of Minimum Dominating Sets in Pn × P2 [PDF]

, 2010
A set S of vertices in a graph G is said to be a Smarandachely k-dominating set if each vertex of G is dominated by at least k vertices of S.
Kishori P. Narayankar, Shirakol, Shailaja S., Shailaja S. Shirakol, H.B.Walikar, Narayankar, Kishori P., H. B. Walikar   +5 more
core   +1 more source

Paired-domination number of a graph and its complement

Discrete Mathematics, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Odile Favaron, Hossein Karami 0002, Seyed Mahmoud Sheikholeslami   +2 more
openaire   +3 more sources

Paired-domination in graphs [PDF]

, 2013
D.Phil. (Mathematics)Domination and its variants are now well studied in graph theory. One of these variants, paired-domination, requires that the subgraph induced by the dominating set contains a perfect matching.
McCoy, John Patrick
core   +1 more source

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

Therapeutic 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, Berrak Itır Aylı, Nüket Paksoy   +2 more
wiley   +1 more source

Domination Analysis of Greedy Heuristics For The Frequency Assignment Problem [PDF]

, 2003
We introduce the greedy expectation algorithm for the fixed spectrum version of the frequency assignment problem. This algorithm was previously studied for the travelling salesman problem.
Noble, SD, Noble, Steven, A.E. Koller, Koller, A.E., Noble, S.D., S.D. Noble, Koller, AE   +6 more
core   +1 more source

Γ -Paired dominating graphs of some paths

MATEC Web of Conferences, 2018
A paired dominating set of a graph G = (V(G),E(G)) is a set D of vertices of G such that every vertex is adjacent to some vertex in D, and the subgraph of G induced by D contains a perfect matching. The upper paired domination number of G, denoted by Γpr(
Eakawinrujee Pannawat, Trakultraipruk Nantapath   +1 more
doaj   +1 more source

Calpain small subunit homodimerization is robust and calcium‐independent

FEBS 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, Trina Dykstra‐MacPherson, Mathias A. Bell, Peter L. Davies, Ruby May A. Sullan   +4 more
wiley   +1 more source

The Paired Domination Number of Cubic Graphs

, 2020
Let G be a simple undirected graph with no isolated vertex. A paired dominating set of G is a dominating set which induces a subgraph that has a perfect matching. The paired domination number of G, denoted by γpr(G), is the size of its smallest paired dominating set. Goddard and Henning conjectured that γpr(G) {\leq} 4n/7 holds for every graph G with δ(
Sheng, Bin, Lu, Changhong
openaire   +2 more sources