Results 121 to 130 of about 2,304,207 (332)
Super -edge antimagic total labeling of a subclass of trees
AKCE International Journal of Graphs and Combinatorics, 2017 A graph labeling is a mapping that assigns numbers to graph elements. The domain can be the set of all vertices, the set of all edges or the set of all vertices and edges.
M. Javaid, A.A. Bhatti, M.K. Aslam
doaj +1 more source
Informative labeling schemes for graphs
Theoretical Computer Science, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Ro 31‐8220 suppresses bladder cancer progression via enhancing autophagy in vitro and in vivo
FEBS Open Bio, EarlyView.The pan‐protein kinase C inhibitor Ro‐31‐8220 demonstrates potent anti‐bladder cancer effects both in vitro and in vivo by suppressing migration/invasion, inducing apoptosis and crucially activating autophagy, where blocking autophagy with chloroquine reduces its cell‐killing efficacy, suggesting its promise as a novel therapeutic candidate requiring ...
Shengjun Fu +12 more
wiley +1 more source
On Total H-Irregularity Strength of the Disjoint Union of Graphs
Discussiones Mathematicae Graph Theory, 2020 A simple graph G admits an H-covering if every edge in E(G) belongs to at least to one subgraph of G isomorphic to a given graph H. For the subgraph H ⊆ G under a total k-labeling we define the associated H-weight as the sum of labels of all vertices and
Ashraf Faraha +5 more
doaj +1 more source
Enumeration of labelled chain graphs and labelled essential directed acyclic graphs
Discrete Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Applied Mathematics and Computation, 2019 It is well known that the labeling problems of graphs arise in many (but not limited to) networking and telecommunication contexts. In this paper we introduce the anti-$k$-labeling problem of graphs which we seek to minimize the similarity (or distance) of neighboring nodes.
Xiaxia Guan +4 more
openaire +3 more sources
Most autophagic cell death studies lack evidence of causality
FEBS Open Bio, EarlyView.Of 104 studies claiming autophagic cell death (ACD), only 13 demonstrated both causality and exclusion of apoptosis to confirm true ACD. Most studies relied on correlation‐level data or measured autophagy in isolation, revealing pervasive methodological shortcomings.
Ali Burak Özkaya, Yasmin Ghaseminejad
wiley +1 more source
Key role for inhibins in effective T cell activation, migration and Th17 differentiation
FEBS Open Bio, EarlyView.Activins/inhibins modulate immune responses. Here, we show that inhibins can be produced very early after T cell activation and can act in an autocrine way, favoring Th1 versus Th17 differentiation and CCL19/CCL21 mediated migration. Recombinant inhibin A can restore the Th1/Th17 balance, highlighting the role of inhibins as key regulators of T cell ...
Sandra Ortega‐Francisco +5 more
wiley +1 more source
The incidence matrix and labelings of a graph
Journal of Combinatorial Theory, Series B, 1981 AbstractWe deal with the problem of labeling the edges of a graph in such a way that the labels of the edges incident with any vertex add up to a value prescribed for that vertex. We show that the use of elementary column operations on the incidence matrix is fruitful in giving easy proofs of theorems on magic graphs and labeling |1, 3, 4|.
openaire +2 more sources
Excluding a group-labelled graph
Journal of Combinatorial Theory, Series B, 2009 AbstractThis paper contains a first step towards extending the Graph Minors Project of Robertson and Seymour to group-labelled graphs. For a finite abelian group Γ and Γ-labelled graph G, we describe the class of Γ-labelled graphs that do not contain a minor isomorphic to G.
Jim Geelen, Bert Gerards
openaire +3 more sources