Results 61 to 70 of about 119,419 (266)

COMP–PMEPA1 axis promotes epithelial‐to‐mesenchymal transition in breast cancer cells

Molecular Oncology, EarlyView.
This study reveals that cartilage oligomeric matrix protein (COMP) promotes epithelial‐to‐mesenchymal transition (EMT) in breast cancer. We identify PMEPA1 (protein TMEPAI) as a novel COMP‐binding partner that mediates EMT via binding to the TSP domains of COMP, establishing the COMP–PMEPA1 axis as a key EMT driver in breast cancer.
Konstantinos S. Papadakos, Gilar Gorji‐bahri, Lejla Gradjan, Julia Zajac, Kacper Gil, Yvonne Thokozile Nduku, Anna M. Blom   +6 more
wiley   +1 more source

The lower bound for number of hexagons in strongly regular graphs with parameters $\lambda=1$ and $\mu=2$ [PDF]

E-Journal of Analysis and Applied Mathematics
The existence of $srg(99,14,1,2)$ has been a question of interest for several decades to the moment. In this paper, we consider the structural properties in general for the family of strongly regular graphs with parameters $\lambda =1$ and $\mu =2$.
Reimbay Reimbayev
doaj   +1 more source

EDNRB‐dependent endothelin signaling reduces proliferation and promotes proneural‐to‐mesenchymal transition in gliomas

Molecular Oncology, EarlyView.
Glioma cells mainly express the endothelin receptor EDNRB, while EDNRA is restricted to a perivascular tumor subpopulation. Endothelin signaling reduces glioma cell proliferation while promoting migration and a proneural‐to‐mesenchymal transition associated with poor prognosis. This pathway activates Ca2+, K+, ERK, and STAT3 signalings and is regulated
Donovan Pineau, Leonor Garcia, Hugo Arnold, Antonija Hanžek, Maialen Arrieta, Laurent R Gauthier, Christine Granotier‐Beckers, François D Boussin, Amaury Herbet, Marie Hautière, Valentin Asei‐Ceschino, Clémentin Jacques, Laura Brard, Thomas Harnois, Valérie Coronas, Bruno Constantin, Aurélien Chatelier, Jean Chemin, Serge Urbach, Martial Seveno, Szimonetta Hideg, Chantal Ripoll, Kasandra Aguilar‐Cázarez, Min Zheng, Guo‐Hao Huang, Sheng‐Qing Lv, Lei Zhang, Philippe Rondard, Laurent Prezeau, Jean‐Philippe Pin, Hugues Duffau, Luc Bauchet, Valérie Rigau, Franck Denat, Charles Truillet, Didier Boquet, Jean‐Philippe Hugnot   +36 more
wiley   +1 more source

Spectra of R-Vertex Join and R-Edge Join of Two Graphs

Discussiones Mathematicae - General Algebra and Applications, 2018
The R-graph R(G) of a graph G is the graph obtained from G by intro- ducing a new vertex ue for each e ∈ E(G) and making ue adjacent to both the end vertices of e. In this paper, we determine the adjacency, Lapla- cian and signless Laplacian spectra of R-
Das Arpita, Panigrahi Pratima
doaj   +1 more source

On Order Prime Divisor Graphs of Finite Groups

Discussiones Mathematicae - General Algebra and Applications, 2021
The order prime divisor graph 𝒫𝒟(G) of a finite group G is a simple graph whose vertex set is G and two vertices a, b ∈ G are adjacent if and only if either ab = e or o(ab) is some prime number, where e is the identity element of the group G and o(x ...
Sen Mridul K., Maity Sunil K., Das Sumanta   +2 more
doaj   +1 more source

On regular-stable graphs

Electronic Notes in Discrete Mathematics, 2001
Abstract Abstract A graph G , is λ-regular-stable if it has at least a maximum independent set I , such that for ∀ v ∈ V(G)\I , the number of vertices in NG(V) , ⨆ I , is constant, and equal to λ. Here we give some results for this class of graphs.
Barbosa, R., Cardoso, D.M.
openaire   +2 more sources

Interrogating the immune landscape of microsatellite stable RAS‐mutated colon cancer

Molecular Oncology, EarlyView.
COLOSSUS project RAS‐mutated MSS colon cancer study explored transcriptomics and immune cell density by immunohistochemistry (IHC), Immunoscore (IS), ISIC/TuLIS scores, mutation counts, and detected different prevalences but similar microenvironment composition across immune markers with clinical relevance for future immunotherapy combination ...
Rodrigo Dienstmann, Eduardo García‐Galea, Alice O'Farrell, Zak Kinsella, Maxime Meylan, Florent Petitprez, Ingrid Arijs, Tom Venken, Hari Ps, Adrian Lärkeryd, Ian Miller, Janick Selves, Nadja Meindl‐Beinker, Fiorella Ruiz‐Pace, Elena Élez, Raquel Comas‐Navarro, Frank Lincoln, Dirk Fey, Gift Nyamundanda, Aoife Nolan, Joern Lewin, Raquel Perez‐Lopez, Jonathan Briody, Kathleen Bennett, Walter Kolch, David Matallanas, Alexander Kel, Enrique Arenas, Joaquín Arribas, Bart Ghesquière, Josep Tabernero, Julie Meilleroux, Deborah McNamara, Ray McDermott, Marvin Lim, Mary O'Reilly, Brian Bird, Lisa Stack, Lucia Moloney, Patrick Morris, Keith Egan, Maciej Milewski, Lars Scheuer, Joachim Behringer, Georg Bolz, Ramon Salazar, Cristina Santos, Andrea Ruiz, Orla Casey, Verena Murphy, Matthias Ebert, Livio Trusolino, Diether Lambrechts, Anguraj Sadanandam, Catherine Sautès‐Fridman, Jochen Prehn, Paolo Nuciforo, Jacques Fieschi, Florence Monville, Darran O'Connor, Wolf Fridman, Annette Byrne   +61 more
wiley   +1 more source

Existence of Regular Nut Graphs for Degree at Most 11

Discussiones Mathematicae Graph Theory, 2020
A nut graph is a singular graph with one-dimensional kernel and corresponding eigenvector with no zero elements. The problem of determining the orders n for which d-regular nut graphs exist was recently posed by Gauci, Pisanski and Sciriha.
Fowler Patrick W., Gauci John Baptist, Goedgebeur Jan, Pisanski Tomaž, Sciriha Irene   +4 more
doaj   +1 more source

Distance-Regular Graphs and Halved Graphs

European Journal of Combinatorics, 1986
Let G be a bipartite distance-regular graph with bipartition \(V(G)=X\cup Y\). Let \(V(G')=X\) and, for x and y in X, let x be adjacent to y in G' if and only if x is of distance two from y in G. Then G' is called a halved graph of G, and is distance-regular. This paper discusses whether G' is one of the known, large-diameter, distance-regular graphs.
openaire   +2 more sources

Factorizing regular graphs [PDF]

Journal of Combinatorial Theory, Series B, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources