Results 91 to 100 of about 5,759,724 (297)
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
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
Distinguishing Cartesian Powers of Graphs [PDF]
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
Synchronization in random networks with given expected degree sequences [PDF]
Synchronization in random networks with given expected degree sequences is studied. We also investigate in details the synchronization in networks whose topology is described by classical random graphs, power-law random graphs and hybrid graphs when N ...
Kocarev, L., Checco, P., Biey, Mario
core
Matched spatial transcriptomics and single‐nuclei RNA‐seq were generated for anaplastic and BRAFV600E papillary thyroid cancers revealing generic and tumor‐specific states occurring in cancer cells and in the tumor microenvironment. In this context, cancer dedifferentiation mirrored organoid maturation through ordered thyroid marker gain/loss ...
Adrien Tourneur +11 more
wiley +1 more source
A Vertex Separator Problem for Power Graphs of Groups
Given a graph G, an st-connected vertex separator (CVS) problem refers to the search for a minimum connected component in G whose removal leaves the pair of nodes s and t in two disjoint components.
Haeder Younis Althoby +2 more
doaj +1 more source
Brooks’ theorem on powers of graphs
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
In this paper, the concept of Total semirelib graph of a planar graph is introduced. Authors present a characterization of those graphs whose total semirelib graphs are planar, outer planar, Eulerian, hamiltonian with crossing number ...
Prasad, Manjunath +3 more
core +1 more source
Cancer‐associated mutations in endometriosis reframe a benign disease through molecular oncology
This review aims to comprehensively analyse cancer‐associated somatic mutations (CAMs) present in endometriotic lesions, emphasizing their biological roles, spatial distribution and implications for translational applications in medicine. By contextualizing a benign state within a genomic framework, this analysis seeks to establish its value as a ...
Clarissa Mujacic +15 more
wiley +1 more source
Simplicial complexes defined on groups
This study makes some preliminary observations towards an extension of current work on graphs defined on groups to simplicial complexes. I define a variety of simplicial complexes on a group, which are preserved by automorphisms of the group, and in many
Cameron Peter J.
doaj +1 more source

