Results 31 to 40 of about 5,633 (238)

Extremal values on Zagreb indices of trees with given distance k-domination number

Journal of Inequalities and Applications, 2018
Let G = ( V ( G ) , E ( G ) ) $G=(V(G),E(G))$ be a graph. A set D ⊆ V ( G ) $D\subseteq V(G)$ is a distance k-dominating set of G if for every vertex u ∈ V ( G ) ∖ D $u\in V(G)\setminus D$ , d G ( u , v ) ≤ k $d_{G}(u,v)\leq k$ for some vertex v ∈ D $v ...
Lidan Pei, Xiangfeng Pan
doaj   +1 more source

Distance Vector Domination

This paper will appear in the proceedings of SOFSEM ...
Cordasco, Gennaro, Garagano, Luisa, Rescigno, Adele A.   +2 more
openaire   +3 more sources

Complexity and approximation ratio of semitotal domination in graphs

Communications in Combinatorics and Optimization, 2018
A set $S \subseteq V(G)$ is a semitotal dominating set of a graph $G$ if‎ ‎it is a dominating set of $G$ and‎ ‎every vertex in $S$ is within distance 2 of another vertex of $S$‎. ‎The‎ ‎semitotal domination number $\gamma_{t2}(G)$ is the minimum‎ ‎
Zehui Shao, Pu Wu
doaj   +1 more source

On Minimum Maximal Distance-k Matchings [PDF]

Discrete Mathematics & Theoretical Computer Science, 2018
We study the computational complexity of several problems connected with finding a maximal distance-$k$ matching of minimum cardinality or minimum weight in a given graph. We introduce the class of $k$-equimatchable graphs which is an edge analogue of $k$
Yury Kartynnik, Andrew Ryzhikov
doaj   +1 more source

Superior Eccentric Domination Polynomial

Ratio Mathematica, 2023
In this paper we introduce the superior eccentric domination polynomial $SED(G, φ) = β\sum_{ l=\gamma_{sed}(G)} |sed(G, l)|φ^{l}$ where |sed(G, l)| is the number of all distinct superior eccentric dominating sets with cardinality l and $\gamma_{sed}(G ...
R Tejaskumar, A Mohamed Ismayil
doaj   +1 more source

Lower Bounds for the Total Distance $k$-Domination Number of a Graph

Theory and Applications of Graphs
For $k \geq 1$ and a graph $G$ without isolated vertices, a \emph{total distance $k$-dominating set} of $G$ is a set of vertices $S \subseteq V(G)$ such that every vertex in $G$ is within distance $k$ to some vertex of $S$ other than itself.
Randy R. Davila
doaj   +1 more source

Molecular bases of circadian magnesium rhythms across eukaryotes

FEBS Letters, EarlyView.
Circadian rhythms in intracellular [Mg2+] exist across eukaryotic kingdoms. Central roles for Mg2+ in metabolism suggest that Mg2+ rhythms could regulate daily cellular energy and metabolism. In this Perspective paper, we propose that ancestral prokaryotic transport proteins could be responsible for mediating Mg2+ rhythms and posit a feedback model ...
Helen K. Feord, Gerben van Ooijen
wiley   +1 more source

Isolate g-eccentric domination in fuzzy graph

Ratio Mathematica, 2023
In a fuzzy graph G(ρ, μ), a dominating set D ⊆ P(G) is said to be g-eccentric if at least one g-eccentric vertex a of every vertex b in P − D exists in D.
S. Muthupandiyan, A Mohamed Ismayil
doaj   +1 more source

Interplay between circadian and other transcription factors—Implications for cycling transcriptome reprogramming

FEBS Letters, EarlyView.
This perspective highlights emerging insights into how the circadian transcription factor CLOCK:BMAL1 regulates chromatin architecture, cooperates with other transcription factors, and coordinates enhancer dynamics. We propose an updated framework for how circadian transcription factors operate within dynamic and multifactorial chromatin landscapes ...
Xinyu Y. Nie, Jerome S. Menet
wiley   +1 more source

Irregular domination graphs [PDF]

Contributions to Mathematics, 2022
Caryn Mays, Ping Zhang
doaj   +1 more source