Results 61 to 70 of about 270,997 (279)
Data in Brief, 2022 Electroencephalography (EEG) offers a unique window into the dynamics of the neuronal symphony that powers our brains. Here, we describe a publicly available dataset of EEG recorded from 111 healthy subjects.
Christoffer Hatlestad-Hall +2 more
doaj +1 more source
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 +61 more
wiley +1 more source
Observations on the Lovász θ-Function, Graph Capacity, Eigenvalues, and Strong Products
Entropy, 2023 This paper provides new observations on the Lovász θ-function of graphs. These include a simple closed-form expression of that function for all strongly regular graphs, together with upper and lower bounds on that function for all regular graphs.
Igal Sason
doaj +1 more source
Molecular Oncology, EarlyView.We have established a humanized orthotopic patient‐derived xenograft (Hu‐oPDX) mouse model of high‐grade serous ovarian cancer (HGSOC) that recapitulates human tumor–immune interactions. Using combined anti‐PD‐L1/anti‐CD73 immunotherapy, we demonstrate the model's improved biological relevance and enhanced translational value for preclinical ...
Luka Tandaric +10 more
wiley +1 more source
Cyclic Cordial Labeling for the Lemniscate Graphs and Their Second Powers
Journal of MathematicsA lemniscate graph, usually denoted by Ln,m, is defined as a union of two cycles Cn and Cm that share a common vertex. A simple graph is called cyclic group cordial if we can provide a three elements’ cyclic group labeling satisfying certain conditions ...
M. A. AbdAllah +3 more
doaj +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
On the theta number of powers of cycle graphs [PDF]
, 2011 We give a closed formula for Lovasz theta number of the powers of cycle graphs and of their complements, the circular complete graphs. As a consequence, we establish that the circular chromatic number of a circular perfect graph is computable in ...
Bachoc, Christine +2 more
core +3 more sources
On the metric dimension of Cartesian powers of a graph
, 2019 A set of vertices $S$ resolves a graph if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The metric dimension of a graph is the minimum cardinality of a resolving set of the graph.
Jiang, Zilin, Polyanskii, Nikita
core +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 +2 more sources
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