Results 101 to 110 of about 390,323 (304)
Independence Number of Graphs with a Prescribed Number of Cliques
The Electronic Journal of Combinatorics, 2019 We consider the following problem posed by Erdős in 1962. Suppose that $G$ is an $n$-vertex graph where the number of $s$-cliques in $G$ is $t$. How small can the independence number of $G$ be? Our main result suggests that for fixed $s$, the smallest possible independence number undergoes a transition at $t=n^{s/2+o(1)}$. In the case of triangles ($s=
Tom Bohman, Dhruv Mubayi
openaire +4 more sources
Hyperosmotic stress induces PARP1‐mediated HPF1‐dependent mono(ADP‐ribosyl)ation
FEBS Letters, EarlyView.Sorbitol‐induced hyperosmotic stress rapidly induces reversible mono(ADP‐ribosyl)ation (MARylation) on PARP1 without the signs of genotoxic signaling. We show that PARP1 autoMARylation is HPF1 dependent and forms hydroxylamine‐resistant O‐glycosidic linkages.
Anna Georgina Kopasz +11 more
wiley +1 more source
Explaining de facto judicial independence [PDF]
Judicial Independence (JI) as factually implemented varies considerably between countries. Since de iure JI is an imperfect predictor of de facto JI, a number of variables that might determine the factual level of judicial independence is theoretically ...
Bernd Hayo, Stefan Voigt
core
On the independence number of graphs related to a polarity
, 2019 We investigate the independence number of two graphs constructed from a polarity of PG(2, q). For the first graph under consideration, the Erdos-Renyi graph ERq, we provide an improvement on the known lower bounds on its independence number.
Francesco Pavese +5 more
core +1 more source
On estimation of extremal entries of the principal eigenvector of a graph
AKCE International Journal of Graphs and CombinatoricsLet [Formula: see text] be the principal eigenvector corresponding to the spectral radius [Formula: see text] of a graph G of order n. In this paper, we find some bounds on the ratio of the maximal component [Formula: see text] to the minimal component ...
Prohelika Das, Bipanchy Buzarbarua
doaj +1 more source
Bounds on the 2-domination number in cactus graphs [PDF]
Opuscula Mathematica, 2006 A \(2\)-dominating set of a graph \(G\) is a set \(D\) of vertices of \(G\) such that every vertex not in \(S\) is dominated at least twice. The minimum cardinality of a \(2\)-dominating set of \(G\) is the \(2\)-domination number \(\gamma_{2}(G)\).
Mustapha Chellali
doaj
An isoform of 14‐3‐3 protein regulates transbilayer lipid movement at the plasma membrane
FEBS Letters, EarlyView.Loss of 14‐3‐3ζ in CHO cells confers resistance to exogenous phosphatidylserine (PS) and impairs endocytosis‐independent inward flip‐flop of fluorescent PS at the plasma membrane. RNAi‐mediated knockdown reproduces this defect, while no additive effect is seen in ATP11C‐deficient cells.
Akiko Yamaji‐Hasegawa +3 more
wiley +1 more source
Power graphs and a combinatorial property of abundant semigroups
AKCE International Journal of Graphs and CombinatoricsThe aim of this paper is to study the power graph of a semigroup. We obtain sufficient and necessary conditions for the independence number of the power graph of an (IC) abundant semigroups (superabundant semigroups) to be finite.
Junying Guo, Xiaojiang Guo
doaj +1 more source
A dynamic domination problem in trees [PDF]
Transactions on Combinatorics, 2015 We consider a dynamic domination problem for graphs in which an infinite sequence of attacks occur at vertices with guards and the guard at the attacked vertex is required to vacate the vertex by moving to a neighboring vertex with no guard. Other guards
William Klostermeyer, Christina Mynhardt
doaj
The ubiquitin ligase RNF115 is required for the clearance of damaged lysosomes
FEBS Letters, EarlyView.Upon lysosomal rupture, an E3 ubiquitin ligase RNF115 translocates from the cytosol to the damaged lysosomal membrane. Moreover, RNF115 depletion impairs the clearance of damaged lysosomes, identifying it as a key regulator of lysosomal quality control.
Sae Nakanaga +3 more
wiley +1 more source