Results 71 to 80 of about 1,217,256 (282)
Perfect connected-dominant graphs
Discussiones Mathematicae Graph Theory, 2003 If \(D\) is a dominating set in a graph \(G\) and \(G[D]\) is connected, then \(D\) is a connected dominating set. The minimum size of a connected dominating set in \(G\) is called the connected domination number of \(G\), denoted by \(\gamma_c(G)\). A graph \(G\) is a perfect connected-dominant graph if \(\gamma(H)= \gamma_c(H)\) for each connected ...
openaire +2 more sources
Design and analysis strategies for robust microbiome ageing research
FEBS Letters, EarlyView.The gut microbiome changes with age and associates with age‐related morbidity and mortality, establishing it as a potential biomarker and intervention target for ageing. Realising this potential requires methodological rigour, yet distinguishing biological signals from methodological artefacts remains challenging across cohorts. This review provides an
Mark Olenik +5 more
wiley +1 more source
Resolving connected domination in graphs
, 2015 For an ordered subset W = w1,w2, · · · ,wk of vertices and a vertex v in a connected graph G = (V,E), the (metric) representation of v with respect to W is the k-vector r(v|W) = (d(v,w1), d(v,w2), · · · , d(v,wk)).
Soner, N. D. +3 more
core +1 more source
Some inequalities about connected domination number [PDF]
, 1996 Let G = (V,E) be a graph. In this note, γc, ir, γ, i, β0, Γ, IR denote the connected domination number, the irredundance number, the domination number, the independent domination number, the independence number, the upper domination number and the upper ...
Liu, Bolian, Bo, Cheng
core +1 more source
Proper connection number and connected dominating sets
Theoretical Computer Science, 2015 The proper connection number $pc(G)$ of a connected graph $G$ is defined as the minimum number of colors needed to color its edges, so that every pair of distinct vertices of $G$ is connected by at least one path in $G$ such that no two adjacent edges of the path are colored the same, and such a path is called a proper path. In this paper, we show that
Xueliang Li 0001 +2 more
openaire +3 more sources
Investigating transcription factor dynamics in health and disease using FRAP
FEBS Letters, EarlyView.FRAP analysis of GFP‐tagged transcription factors reveals how molecular mobility and target engagement change in response to drug treatment. By combining live‐cell imaging, quantitative model fitting, and statistical analysis, this approach uncovers transcription factor dynamics linked to disease mechanisms, providing a powerful framework for ...
Kannan Govindaraj +3 more
wiley +1 more source
Connected domination number of graph [PDF]
, 2014 V diplomskem delu je obravnavano povezano dominantno število grafa. Na začetku so podrobneje razloženi osnovni pojmi teorije grafov, ki so potrebni za razumevanje celotnega dela. V osrednjem delu so opisane lastnosti povezanega dominantnega števila grafa
Smej, Renato
core
Matching properties in connected domination critical graphs [PDF]
, 2008 A dominating set of vertices S of a graph G is connected if the subgraph G[S] is connected. Let γc(G) denote the size of any smallest connected dominating set in G.
Plummer, Michael D. +2 more
core +1 more source
Domination Numbers of Amalgamations of Cycles at Connected Subgraphs
Journal of Mathematics, 2022 A set S of vertices of a graph G is a dominating set of G if every vertex in VG is adjacent to some vertex in S. A minimum dominating set in a graph G is a dominating set of minimum cardinality.
Prakassawat Boonmee +2 more
doaj +1 more source
The Forcing Geodetic Cototal Domination Number of a Graph
Ratio Mathematica, 2022 Let be a geodetic cototal domination set of . A subset is called a forcing subset for if is the unique minimum geodetic cototal domination set containing . The minimum cardinality T is the forcing geodetic cototal domination number of S is denotedby ,
S L Sumi, V Mary Gleeta, J Befija Minnie
doaj +1 more source