Results 71 to 80 of about 268,821 (264)
A Study on the Nourishing Number of Graphs and Graph Powers [PDF]
Let \(\mathbb{N}_{0}\) be the set of all non-negative integers and \(\mathcal{P}(\mathbb{N}_{0})\) be its power set. Then, an integer additive set-indexer (IASI) of a given graph \(G\) is defined as an injective function \(f:V(G)\to \mathcal{P}(\mathbb{N}_{0})\) such that the induced edge-function \(f^+:E(G) \to\mathcal{P}(\mathbb{N}_{0})\) defined by \
Naduvath, Sudev, Augustine, Germina
openaire +5 more sources
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
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
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
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
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
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
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
Gut microbiota alterations in patients with non‐small‐cell lung cancer undergoing chemoradiotherapy
We investigated the impact of concurrent chemoradiotherapy (CRT) on the gut microbiota in patients with locally advanced non‐small‐cell lung cancer. Overall gut microbiota composition remained largely stable throughout CRT while antibiotic exposure may influence microbial diversity.
Hanne Marte Nymoen +19 more
wiley +1 more source
On groups with specified quotient power graphs [PDF]
. In this paper we study some relations between the power andquotient power graph of a finite group. These interesting relations motivateus to find some graph theoretical properties of the quotient power graphand the proper quotient power graph of a ...
Mostafa Shaker, Mohammadali Iranmanesh
doaj

