Results 81 to 90 of about 945,213 (292)
CCDC80 suppresses high‐grade serous ovarian cancer migration via negative regulation of B7‐H3
Molecular Oncology, EarlyView.PAX8 is a lineage‐specific master regulator of transcription in high‐grade serous ovarian cancer (HGSC) progression. We show for the first time that PAX8 facilitates proliferation and metastasis by repressing the cell autonomous tumor suppressor CCDC80 and inducing B7‐H3 expression.
Aya Saleh +12 more
wiley +1 more source
On Generalizations of Pairwise Compatibility Graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceA graph $G$ is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree and an interval $I$, such that each leaf of the tree is a vertex of the graph, and there is an edge $\{ x, y \}$ in $G$ if and only if the weight of the path in the
Tiziana Calamoneri +3 more
doaj +1 more source
Portable Graph Layout and Editing
, 1996 The Graph Layout Toolkit and the Graph Editor Toolkit are portable, flexible toolkits for graph layout and graph editing systems. The Graph Layout Toolkit contains four highly customizable layout algorithms, and supports hierarchical graphs.
Himsolt, Michael +3 more
core +1 more source
Tulgeity of Line, Middle and Total Graph of Wheel Graph Families [PDF]
, 2010 Tulgeity r(G) is the maximum number of disjoint, point induced, non acyclic subgraphs contained in G. In this paper one finds the tulgeity of line, middle and total graph of wheel graph, Gear graph and Helm ...
Vernold, Vivin +2 more
core +1 more source
Molecular Oncology, EarlyView.Dormant cancer cells can hide in distant organs for years, evading treatment and the immune system. This review highlights how signals from the surrounding tissue and immune environment keep these cells inactive or trigger their reawakening. Understanding these mechanisms may help develop therapies to eliminate or control dormant cells and prevent ...
Kanishka Tiwary +1 more
wiley +1 more source
Distinguishing Cartesian Powers of Graphs [PDF]
The Electronic Journal of Combinatorics, 2005 Given a graph $G$, a labeling $c:V(G) \rightarrow \{1, 2, \ldots, d\}$ is said to be $d$-distinguishing if the only element in ${\rm Aut}(G)$ that preserves the labels is the identity. The distinguishing number of $G$, denoted by $D(G)$, is the minimum $d$ such that $G$ has a $d$-distinguishing labeling.
openaire +3 more sources
On Pathos Semitotal and Total Block Graph of a Tree [PDF]
, 2011 The concept of pathos of a graph G was introduced by Harary [2], as a collection of minimum number of line disjoint open paths whose union is G. The path number of a graph G is the number of paths in pathos.
Muddebihal M. H.
core +1 more source
Molecular Oncology, EarlyView.The novel styrylquinazolinone‐based molecule W1B effectively suppresses glioblastoma by inhibiting IGF1R and EGFR. In high‐glucose microenvironments driving tumor resistance, W1B acts synergistically with the EGFR inhibitor dacomitinib. This combination safely blocks compensatory survival signaling in zebrafish xenograft models. Showcasing promising in
Patryk Rurka +9 more
wiley +1 more source
Tumor B‐cell infiltration in platinum‐treated advanced muscle‐invasive urothelial carcinoma
Molecular Oncology, EarlyView.Bladder tumors with higher pretreatment memory B‐cell infiltration were linked to longer survival after cisplatin chemotherapy, but not carboplatin. These tumors also showed more organized immune structures (tertiary lymphoid structures) and a shared pro‐inflammatory B‐cell‐rich community, suggesting that memory B cells may help identify patients most ...
Konrad Stawiski +10 more
wiley +1 more source
Brooks’ theorem on powers of graphs
Discrete Mathematics, 2014 We prove that for $k\geq 3$, the bound given by Brooks' theorem on the chromatic number of $k$-th powers of graphs of maximum degree $Δ\geq 3$ can be lowered by 1, even in the case of online list coloring.
Bonamy, Marthe, Bousquet, Nicolas
openaire +4 more sources