Results 41 to 50 of about 7,428 (262)
Domination and Independent Domination in Extended Supergrid Graphs
Algorithms, 2022 Supergrid graphs are derived by computing stitch paths for computerized embroidery machines. In the past, we have studied the Hamiltonian-related properties of supergrid graphs and their subclasses of graphs. In this paper, we propose a generalized graph
Jong-Shin Chen +3 more
doaj +1 more source
Inequalities involving independence domination, f-domination, connected and total f-domination numbers [PDF]
Czechoslovak Mathematical Journal, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Disordered but rhythmic—the role of intrinsic protein disorder in eukaryotic circadian timing
FEBS Letters, EarlyView.Unstructured domains known as intrinsically disordered regions (IDRs) are present in nearly every part of the eukaryotic core circadian oscillator. IDRs enable many diverse inter‐ and intramolecular interactions that support clock function. IDR conformations are highly tunable by post‐translational modifications and environmental conditions, which ...
Emery T. Usher, Jacqueline F. Pelham
wiley +1 more source
A note on domination and independence-domination numbers of graphs
Ars Mathematica Contemporanea, 2012 Vizing's conjecture is true for graphs G satisfying γ i ( G ) = γ ( G ), where γ ( G ) is the domination number of a graph G and γ i ( G ) is the independence-domination number of G , that is, the maximum, over all independent sets I in G , of the minimum number of vertices needed to dominate I . The equality γ i ( G ) = γ (
openaire +4 more sources
Domination and independence number of large 2-crossing-critical graphs
Ars Mathematica Contemporanea, 2023 18 pages, 15 ...
Iršič, Vesna +4 more
openaire +4 more sources
Protein pyrophosphorylation by inositol pyrophosphates — detection, function, and regulation
FEBS Letters, EarlyView.Protein pyrophosphorylation is an unusual signaling mechanism that was discovered two decades ago. It can be driven by inositol pyrophosphate messengers and influences various cellular processes. Herein, we summarize the research progress and challenges of this field, covering pathways found to be regulated by this posttranslational modification as ...
Sarah Lampe +3 more
wiley +1 more source
Bounds on Co-Independent Liar’s Domination in Graphs
Journal of Mathematics, 2021 A set S⊆V of a graph G=V,E is called a co-independent liar’s dominating set of G if (i) for all v∈V, NGv∩S≥2, (ii) for every pair u,v∈V of distinct vertices, NGu∪NGv∩S≥3, and (iii) the induced subgraph of G on V−S has no edge.
K. Suriya Prabha +3 more
doaj +1 more source
Time after time – circadian clocks through the lens of oscillator theory
FEBS Letters, EarlyView.Oscillator theory bridges physics and circadian biology. Damped oscillators require external drivers, while limit cycles emerge from delayed feedback and nonlinearities. Coupling enables tissue‐level coherence, and entrainment aligns internal clocks with environmental cues.
Marta del Olmo +2 more
wiley +1 more source
Graph polynomials for a class of DI-pathological graphs
AKCE International Journal of Graphs and Combinatorics, 2020 Let be a simple graph. A dominating set is a set such that the closed neighborhood of is the entire vertex set. An independence set of a graph is a subset of vertices that are pairwise non-adjacent.
James M. Hammer, Joshua Harrington
doaj +1 more source
A characterization of trees with equal 2-domination and 2-independence numbers [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 A set $S$ of vertices in a graph $G$ is a $2$-dominating set if every vertex of $G$ not in $S$ is adjacent to at least two vertices in $S$, and $S$ is a $2$-independent set if every vertex in $S$ is adjacent to at most one vertex of $S$.
Christoph Brause +2 more
doaj +1 more source