Results 91 to 100 of about 5,537,312 (288)
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
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
, 2013 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
Molecular Oncology, EarlyView.Single‐cell multi‐omics reveals epigenetic heterogeneity across therapy‐adaptive tumor states, including quiescent/dormant, drug‐tolerant persister, and EMT‐like phenotypes. By linking regulatory features with state‐associated biomarkers, these approaches inform biomarker‐guided therapeutic strategies for evolving tumors.
Hee Jung Kim +3 more
wiley +1 more source
A Vertex Separator Problem for Power Graphs of Groups
MathematicsGiven 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
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
Pragmatic Graph Rewriting Modifications [PDF]
, 1999 We present new pragmatic constructs for easing programming in visual graph rewriting programming languages. The first is a modification to the rewriting process for nodes the host graph, where nodes specified as 'Once Only' in the LHS of a rewrite match ...
Rodgers, Peter +3 more
core +1 more source
Molecular Oncology, EarlyView.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
Simplicial complexes defined on groups
Open MathematicsThis 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
Signless Laplacian spectrum of power graphs of finite cyclic groups
AKCE International Journal of Graphs and Combinatorics, 2020 In this paper, we have studied the Signless Laplacian spectrum of the power graph of finite cyclic groups. We have shown that is an eigen value of Signless Laplacian of the power graph of with multiplicity at least In particular, using the theory of ...
Subarsha Banerjee, Avishek Adhikari
doaj +1 more source