Results 51 to 60 of about 587,527 (280)

Spectra of regular quantum graphs [PDF]

, 2001
We consider a class of simple quasi one-dimensional classically non-integrable systems which capture the essence of the periodic orbit structure of general hyperbolic nonintegrable dynamical systems.
A. Messiah, A. Selberg, H. Bohr, H. Friedrich, H. P. Baltes, H. Schanz, H.-J. Stöckmann, J. B. Keller, J.-P. Roth, K. G. Anderson, L. D. Landau, L. Sirko, M. Gutzwiller, M. Keeler, M. Pascaud, M. V. Berry, R. Blümel, R. Blümel, R. Courant, R. E. Prange, R. V. Jensen, S. Flügge, T. Kottos, U. Smilansky, V. I. Arnold, V. I. Arnold, Y. C. Lai, Yu. Dabaghian, Yu. Dabaghian   +28 more
core   +2 more sources

Introduction to Topological Indices in Neutrosophic Graphs [PDF]

Neutrosophic Sets and Systems, 2020
Neutrosophic Graphs are graphs that follow three-valued logic. They may be considered a fuzzy graph, although in some cases, it is difficult to optimize and model them using fuzzy graphs. In this paper, the first and second Zagreb indices, the Harmonic
Masoud Ghods, Zahra Rostami
doaj   +1 more source

Dual targeting of RET and SRC synergizes in RET fusion‐positive cancer cells

Molecular Oncology, EarlyView.
Despite the strong activity of selective RET tyrosine kinase inhibitors (TKIs), resistance of RET fusion‐positive (RET+) lung cancer and thyroid cancer frequently occurs and is mainly driven by RET‐independent bypass mechanisms. Son et al. show that SRC TKIs significantly inhibit PAK and AKT survival signaling and enhance the efficacy of RET TKIs in ...
Juhyeon Son, Lily L. Remsing Rix, Bin Fang, Eric A. Welsh, Nicole V. Bremer, Valentina Foglizzo, Paola Roa, Nickole Sigcha‐Coello, Yi Liao, Eric B. Haura, Alexander Drilon, John M. Koomen, Emiliano Cocco, Uwe Rix   +13 more
wiley   +1 more source

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

Non-Isolated Resolving Sets of Corona Graphs with Some Regular Graphs

Mathematics, 2022
Let G be a connected, simple, and finite graph. For an ordered set W={w1,w2,…,wk}⊆V(G) and a vertex v of G, the representation of v with respect to W is the k-vector r(v|W)=(dG(v,w1),…,dG(v,wk)).
Wahyuni Abidin, Anm Salman, Suhadi Wido Saputro   +2 more
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

Non-regular graphs with minimal total irregularity

, 2014
The {\it total irregularity} of a simple undirected graph $G$ is defined as ${\rm irr}_t(G) =$ $\frac{1}{2}\sum_{u,v \in V(G)}$ $\left| d_G(u)-d_G(v) \right|$, where $d_G(u)$ denotes the degree of a vertex $u \in V(G)$.
Abdo, Hosam, Dimitrov, Darko
core   +1 more source

Graphs with many valencies and few eigenvalues [PDF]

, 2015
Dom de Caen posed the question whether connected graphs with three distinct eigenvalues have at most three distinct valencies. We do not answer this question, but instead construct connected graphs with four and five distinct eigenvalues and arbitrarily ...
Koolen, Jack H., van Dam, Edwin R., Xia, Zheng-jiang   +2 more
core   +1 more source