Results 111 to 120 of about 8,223,452 (320)

Remarks on Dynamic Monopolies with Given Average Thresholds

Discussiones Mathematicae Graph Theory, 2015
Dynamic monopolies in graphs have been studied as a model for spreading processes within networks. Together with their dual notion, the generalized degenerate sets, they form the immediate generalization of the classical notions of vertex covers and ...
Centeno Carmen C., Rautenbach Dieter
doaj   +1 more source

Convex Independence in Permutation Graphs

, 2016
A set C of vertices of a graph is P_3-convex if every vertex outside C has at most one neighbor in C. The convex hull \sigma(A) of a set A is the smallest P_3-convex set that contains A.
B Courcelle, B Dushnik, I Ramos, K Baker, P Dreyer, P Duchet, P Edelman, R Barbosa, R Borie, R Karp, S Franklin, T Bisztriczky   +11 more
core   +1 more source

Spatiotemporal and quantitative analyses of phosphoinositides – fluorescent probe—and mass spectrometry‐based approaches

FEBS Letters, EarlyView.
Fluorescent probes allow dynamic visualization of phosphoinositides in living cells (left), whereas mass spectrometry provides high‐sensitivity, isomer‐resolved quantitation (right). Their synergistic use captures complementary aspects of lipid signaling. This review illustrates how these approaches reveal the spatiotemporal regulation and quantitative
Hiroaki Kajiho, Shin Morioka, Junko Sasaki, Takehiko Sasaki   +3 more
wiley   +1 more source

The ramsey number for theta graph versus a clique of order three and four

Discussiones Mathematicae Graph Theory, 2014
For any two graphs F1 and F2, the graph Ramsey number r(F1, F2) is the smallest positive integer N with the property that every graph on at least N vertices contains F1 or its complement contains F2 as a subgraph.
Bataineh M.S.A., Jaradat M.M.M., Bateeha M.S.   +2 more
doaj   +1 more source

Distributed Approximation of Maximum Independent Set and Maximum Matching

, 2017
We present a simple distributed $\Delta$-approximation algorithm for maximum weight independent set (MaxIS) in the $\mathsf{CONGEST}$ model which completes in $O(\texttt{MIS}(G)\cdot \log W)$ rounds, where $\Delta$ is the maximum degree, $\texttt{MIS}(G)$
Bar-Yehuda Reuven, Bodlaender Marijke HL, Czygrinow Andrzej, Edmonds Jack, Halldórsson Magnús M, Kuhn Fabian   +5 more
core   +1 more source

The anti‐CRISPR protein AcrIE8.1 inhibits the type I‐E CRISPR‐Cas system by directly binding to the Cascade subunit Cas11

FEBS Letters, EarlyView.
In this study, we present the structure of AcrIE8.1, a previously uncharacterized anti‐CRISPR protein that inhibits the type I‐E CRISPR‐Cas system. Through a combination of structural and biochemical analyses, we demonstrate that AcrIE8.1 directly binds to the Cas11 subunit of the Cascade complex to inhibit the CRISPR‐Cas system.
Young Woo Kang, Hyun Ho Park
wiley   +1 more source

Simplicial complexes defined on groups

Open Mathematics
This study makes some preliminary observations towards an extension of current work on graphs defined on groups to simplicial complexes. I define a variety of simplicial complexes on a group, which are preserved by automorphisms of the group, and in many
Cameron Peter J.
doaj   +1 more source

An intracellular transporter mitigates the CO2‐induced decline in iron content in Arabidopsis shoots

FEBS Letters, EarlyView.
This study identifies a gene encoding a transmembrane protein, MIC, which contributes to the reduction of shoot Fe content observed in plants under elevated CO2. MIC is a putative Fe transporter localized to the Golgi and endosomal compartments. Its post‐translational regulation in roots may represent a potential target for improving plant nutrition ...
Timothy Mozzanino, Meijie Li, Cécile Fizames, Mattia Adamo, Laurence Lejay, Christian Dubos, Matthieu Platre, Antoine Martin   +7 more
wiley   +1 more source

Bounds on the Clique and the Independence Number for Certain Classes of Graphs

Mathematics
In this paper, we study the class of graphs Gm,n that have the same degree sequence as two disjoint cliques Km and Kn, as well as the class G¯m,n of the complements of such graphs.
Valentin E. Brimkov, Reneta P. Barneva
doaj   +1 more source

Independent point-set dominating sets in graphs

AKCE International Journal of Graphs and Combinatorics, 2020
In this paper, we study graphs which possess an independent point-set dominating set (in short, ipsd-set). We call such a graph as an ipsd-graph. We first provide general structural characterization of separable ipsd-graphs and thereafter, in our quest ...
Purnima Gupta, Alka Goyal, Ranjana Jain
doaj   +1 more source