Results 71 to 80 of about 390,323 (304)
, 2000 Studying independence of goals has proven very useful in the context of logic programming. In particular, it has provided a formal basis for powerful automatic parallelization tools, since independence ensures that two goals may be evaluated in parallel ...
Hermenegildo, Manuel V. +2 more
core +1 more source
Some results on the independence number of connected domination critical graphs
AKCE International Journal of Graphs and Combinatorics, 2018 A --critical graph is a graph with connected domination number and for any pair of non-adjacent vertices and of . Let and be respectively the clique number and the independence number of a graph.
P. Kaemawichanurat, T. Jiarasuksakun
doaj +1 more source
On the 2-token graph of a graph
AKCE International Journal of Graphs and Combinatorics, 2020 Let be a graph and let be a positive integer. Let = and . The -token graph is the graph with vertex set and two vertices and are adjacent if and , where denotes the symmetric difference. In this paper we present several basic results on 2-token graphs.
J. Deepalakshmi +3 more
doaj +1 more source
Reciprocal control of viral infection and phosphoinositide dynamics
FEBS Letters, EarlyView.Phosphoinositides, although scarce, regulate key cellular processes, including membrane dynamics and signaling. Viruses exploit these lipids to support their entry, replication, assembly, and egress. The central role of phosphoinositides in infection highlights phosphoinositide metabolism as a promising antiviral target.
Marie Déborah Bancilhon, Bruno Mesmin
wiley +1 more source
Understanding judicial independence in Vanuatu [PDF]
, 2015 : This paper is intended to fill a gap in the literature concerning the Vanuatu judiciary, as this topic is rarely addressed other than in reports by international non-government organisations, such as Transparency International and its local chapter ...
Miranda Forsyth
core
Interpolating between bounds on the independence number [PDF]
, 2009 For a non-negative integer T, we prove that the independence number of a graph G=(V,E) in which every vertex belongs to at most T triangles is at least ∑u∈Vf(d(u),T) where d(u) denotes the degree of a vertex u∈V, f(d,T)=1d+1 for T≥d2 and f(d,T)=(1+(d2−d ...
Anett Boßecker +3 more
core +1 more source
On The Independence Number Of Some Strong Products Of Cycle-Powers
Foundations of Computing and Decision Sciences, 2015 In the paper we give some theoretical and computational results on the third strong power of cycle-powers, for example, we have found the independence numbers α((C102)√3) = 30 and α((C144)√3) = 14.
Jurkiewicz Marcin +2 more
doaj +1 more source
Independence numbers of polyhedral graphs
Applied Mathematics and ComputationA polyhedral graph is a $3$-connected planar graph. We find the least possible order $p(k,a)$ of a polyhedral graph containing a $k$-independent set of size $a$ for all positive integers $k$ and $a$. In the case $k = 1$ and $a$ even, we prove that the extremal graphs are exactly the vertex-face (radial) graphs of maximal planar graphs.
Gaspoz S., Maffucci R. W.
openaire +4 more sources
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 +3 more
wiley +1 more source
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