Results 41 to 50 of about 115,450 (267)

Edge-distance-regular graphs [PDF]

Journal of Combinatorial Theory, Series A, 2011
Edge-distance-regularity is a concept recently introduced by the authors which is similar to that of distance-regularity, but now the graph is seen from each of its edges instead of from its vertices. More precisely, a graph Γ with adjacency matrix A is edge-distance-regular when it is distance-regular around each of its edges and with the same ...
Cámara Vallejo, Marc, Dalfó Simó, Cristina, Fàbrega Canudas, José, Fiol Mora, Miquel Àngel, Garriga Valle, Ernest   +4 more
openaire   +4 more sources

Transcriptional network analysis of PTEN‐protein‐deficient prostate tumors reveals robust stromal reprogramming and signs of senescent paracrine communication

Molecular Oncology, EarlyView.
Combining PTEN protein assessment and transcriptomic profiling of prostate tumors, we uncovered a network enriched in senescence and extracellular matrix (ECM) programs associated with PTEN loss and conserved in a mouse model. We show that PTEN‐deficient cells trigger paracrine remodeling of the surrounding stroma and this information could help ...
Ivana Rondon‐Lorefice, Jose I. Lopez, Aitziber Ugalde‐Olano, Maite Zufiaurre, Ianire Astobiza, Natalia Martin‐Martin, Laura Bozal‐Basterra, Saioa Garcia‐Longarte, Amaia Zabala‐Letona, Sofia Rey, Aida Santos‐Martin, Miguel Unda, Ana Loizaga‐Iriarte, Mariona Graupera, Paolo Nuciforo, Arkaitz Carracedo, Isabel Mendizabal   +16 more
wiley   +1 more source

GRAPHS \(\Gamma\) OF DIAMETER 4 FOR WHICH \(\Gamma_{3,4}\) IS A STRONGLY REGULAR GRAPH WITH \(\mu=4,6\)

Ural Mathematical Journal
We consider antipodal graphs \(\Gamma\) of diameter 4 for which  \(\Gamma_{1,2}\) is a strongly regular graph. A.A. Makhnev and D.V. Paduchikh noticed that, in this case, \(\Delta=\Gamma_{3,4}\) is a strongly regular graph without triangles.
Alexander A. Makhnev, Mikhail P. Golubyatnikov, Konstantin S. Efimov   +2 more
doaj   +1 more source

Chromatic Number of Pseudo-Von neuman Regular Graph

Ibn Al-Haitham Journal for Pure and Applied Sciences, 2020
         Let R be a commutative ring , the pseudo – von neuman  regular graph of the ring R is define as a graph whose vertex set consists of all elements of R and any two distinct vertices a and b are adjacent if and only if   , this graph denoted by
Nabeel E. Arif, Nermen J. Khalel
doaj   +1 more source

Tight Distance-Regular Graphs [PDF]

Journal of Algebraic Combinatorics, 2000
We consider a distance-regular graph $\G$ with diameter $d \ge 3$ and eigenvalues $k= _0> _1>... > _d$. We show the intersection numbers $a_1, b_1$ satisfy $$ ( _1 + {k \over a_1+1}) ( _d + {k \over a_1+1}) \ge - {ka_1b_1 \over (a_1+1)^2}. $$ We say $\G$ is {\it tight} whenever $\G$ is not bipartite, and equality holds above.
Jurišić, Aleksandar, Koolen, Jack, Terwilliger, Paul   +2 more
openaire   +2 more sources

Effective therapeutic targeting of CTNNB1‐mutant hepatoblastoma with WNTinib

Molecular Oncology, EarlyView.
WNTinib, a Wnt/CTNNB1 inhibitor, was tested in hepatoblastoma (HB) experimental models. It delayed tumor growth and improved survival in CTNNB1‐mutant in vivo models. In organoids, WNTinib outperformed cisplatin and showed enhanced efficacy in combination therapy, supporting its potential as a targeted treatment for CTNNB1‐mutated HB.
Ugne Balaseviciute, Júlia Huguet‐Pradell, Jordi Abril‐Fornaguera, Albert Gris‐Oliver, Alex Rialdi, Elisa Fernández‐Martínez, Carla Montironi, Vanessa Del Pozo, Peter Houghton, Laura Zanatto, Agavni Mesropian, Ieva Keraite, Swan Thung, Carolina Armengol, Pau Sancho‐Bru, Ernesto Guccione, Roser Pinyol, Josep M. Llovet   +17 more
wiley   +1 more source

Chromatic Number and some Properties of Pseudo-Von Neumann Regular graph of Cartesian Product of Rings

Tikrit Journal of Pure Science, 2020
Let R be a commutative ring, the Pseudo – Von Neumann  regular graph of the ring R is define as a graph whose vertex set consists of all elements of R and any two distinct vertices a and b are adjacent if and only if , this graph is denoted by P-VG(R ...
Nermen J. Khalel, Nabeel E. Arif
doaj   +1 more source

Nim-Regularity of Graphs [PDF]

The Electronic Journal of Combinatorics, 1999
Ehrenborg and Steingrímsson defined simplicial Nim, and defined Nim-regular complexes to be simplicial complexes for which simplicial Nim has a particular type of winning strategy. We completely characterize the Nim-regular graphs by the exclusion of two vertex-induced subgraphs, the graph on three vertices with one edge and the graph on five ...
openaire   +2 more sources

LINC01116, a hypoxia‐lncRNA marker of pathological lymphangiogenesis and poor prognosis in lung adenocarcinoma

Molecular Oncology, EarlyView.
The LINC01116 long noncoding RNA is induced by hypoxia and associated with poor prognosis and high recurrence rates in two cohorts of lung adenocarcinoma patients. Here, we demonstrate that besides its expression in cancer cells, LINC01116 is markedly expressed in lymphatic endothelial cells of the tumor stroma in which it participates in hypoxia ...
Marine Gautier‐Isola, Rafael Lopes Goncalves, Marin Truchi, Caroline Lacoux, Célia Scribe, Hugo Cadis, Laetitia Guardini, Sophie Bekisz, Marius Ilié, Paul Hofman, Georges Vassaux, Bernard Mari, Roger Rezzonico   +12 more
wiley   +1 more source

Graphs of intersections of closed polygonal chains

Журнал Белорусского государственного университета: Математика, информатика, 2021
In the paper such subclass of string graphs as intersection graphs of closed polygonal chains (class of CPC-graphs) was considered, necessary conditions for belonging to that class, forbidden subgraphs and operations with graphs which preserve belonging ...
Nikolai P. Prochorov, Ekaterina N. Dul
doaj   +1 more source