Results 101 to 110 of about 4,550,446 (348)
BarekengThe rainbow connection was first introduced by Chartrand in 2006 and then in 2009 Krivelevich and Yuster first time introduced the rainbow vertex connection. Let graph be a connected graph.
Muhammad Ilham Nurfaizi Annadhifi +3 more
doaj +1 more source
A Necessary and Sufficient Condition for Graph Matching to be equivalent to Clique Search [PDF]
, 2009 This paper formulates a necessary and sufficient condition for a generic graph matching problem to be equivalent to the maximum vertex and edge weight clique problem in a derived association graph.
Jain, Brijnesh
core
Embedding Graphs into Embedded Graphs [PDF]
Algorithmica, 2020 A (possibly denerate) drawing of a graph $G$ in the plane is approximable by an embedding if it can be turned into an embedding by an arbitrarily small perturbation. We show that testing, whether a straight-line drawing of a planar graph $G$ in the plane is approximable by an embedding, can be carried out in polynomial time, if a desired embedding of ...
openaire +4 more sources
A synthetic benzoxazine dimer derivative targets c‐Myc to inhibit colorectal cancer progression
Molecular Oncology, EarlyView.Benzoxazine dimer derivatives bind to the bHLH‐LZ region of c‐Myc, disrupting c‐Myc/MAX complexes, which are evaluated from SAR analysis. This increases ubiquitination and reduces cellular c‐Myc. Impairing DNA repair mechanisms is shown through proteomic analysis.
Nicharat Sriratanasak +8 more
wiley +1 more source
Aggressive prostate cancer is associated with pericyte dysfunction
Molecular Oncology, EarlyView.Tumor‐produced TGF‐β drives pericyte dysfunction in prostate cancer. This dysfunction is characterized by downregulation of some canonical pericyte markers (i.e., DES, CSPG4, and ACTA2) while maintaining the expression of others (i.e., PDGFRB, NOTCH3, and RGS5).
Anabel Martinez‐Romero +11 more
wiley +1 more source
The Orchard crossing number of an abstract graph
, 2009 We introduce the Orchard crossing number, which is defined in a similar way to the well-known rectilinear crossing number. We compute the Orchard crossing number for some simple families of graphs. We also prove some properties of this crossing number.
Abstract Graph, David Garber, Elie Feder
core +2 more sources
Metagenomic binning with assembly graph embeddings [PDF]
, 2022 André Lamúrias +4 more
openalex +1 more source
Molecular Oncology, EarlyView.Urinary LGALS3BP is elevated in bladder cancer patients compared to healthy controls as detected by the 1959 antibody–based ELISA. The antibody shows enhanced reactivity to the high‐mannose glycosylated variant secreted by cancer cells treated with kifunensine (KIF).
Asia Pece +18 more
wiley +1 more source
Factors associated with the risk of HIV infection among HIV-exposed infants in Malawi: 2013–2020
BMJ Paediatrics Open, 2022 Janne Estill +6 more
doaj +1 more source
Testing Uniformity of Stationary Distribution [PDF]
, 2016 A random walk on a directed graph gives a Markov chain on the vertices of the graph. An important question that arises often in the context of Markov chain is whether the uniform distribution on the vertices of the graph is a stationary distribution of ...
Chakraborty, Sourav +2 more
core