Results 61 to 70 of about 969,174 (273)
Bivariate Chromatic Polynomials of Mixed Graphs
Discrete Mathematics & Theoretical Computer Science, 2023 The bivariate chromatic polynomial $\chi_G(x,y)$ of a graph $G = (V, E)$, introduced by Dohmen-P\"{o}nitz-Tittmann (2003), counts all $x$-colorings of $G$ such that adjacent vertices get different colors if they are $\le y$. We extend this notion to mixed graphs, which have both directed and undirected edges.
Beck, Matthias, Kolhatkar, Sampada
openaire +5 more sources
On small Mixed Pattern Ramsey numbers [PDF]
, 2014 We call the minimum order of any complete graph so that for any coloring of the edges by $k$ colors it is impossible to avoid a monochromatic or rainbow triangle, a Mixed Ramsey number.
Bartlett, Marcus +4 more
core
Asymptotic dynamics of coined quantum walks on percolation graphs
, 2012 Quantum walks obey unitary dynamics: they form closed quantum systems. The system becomes open if the walk suffers from imperfections represented as missing links on the underlying basic graph structure, described by dynamical percolation.
Jex, Igor +3 more
core +1 more source
Aggressive prostate cancer is associated with pericyte dysfunction
Molecular Oncology, EarlyView.Tumor‐produced TGF‐β drives pericyte dysfunction in prostate cancer. This dysfunction is characterized by downregulation of some canonical pericyte markers (i.e., DES, CSPG4, and ACTA2) while maintaining the expression of others (i.e., PDGFRB, NOTCH3, and RGS5).
Anabel Martinez‐Romero +11 more
wiley +1 more source
Turán problems for mixed graphs
Journal of Combinatorial Theory, Series BWe investigate natural Turán problems for mixed graphs, generalizations of graphs where edges can be either directed or undirected. We study a natural \textit{Turán density coefficient} that measures how large a fraction of directed edges an $F$-free mixed graph can have; we establish an analogue of the Erdős-Stone-Simonovits theorem and give a ...
Nitya Mani, Edward Yu
openaire +3 more sources
The mixed page number of graphs
Theoretical Computer Science, 2022 A linear layout of a graph typically consists of a total vertex order, and a partition of the edges into sets of either non-crossing edges, called stacks, or non-nested edges, called queues. The stack (queue) number of a graph is the minimum number of required stacks (queues) in a linear layout.
Jawaherul Md. Alam +4 more
openaire +2 more sources
Some identities for enumerators of circulant graphs
, 2001 We establish analytically several new identities connecting enumerators of different types of circulant graphs of prime, twice prime and prime-squared orders.
Liskovets, Valery A.
core +1 more source
Molecular Oncology, EarlyView.Development of therapies targeting cancer‐associated fibroblasts (CAFs) necessitates preclinical model systems that faithfully represent CAF–tumor biology. We established an in vitro coculture system of patient‐derived pancreatic CAFs and tumor cell lines and demonstrated its recapitulation of primary CAF–tumor biology with single‐cell transcriptomics ...
Elysia Saputra +10 more
wiley +1 more source
Principal minors of Hermitian (quasi-)Laplacian matrix of second kind for mixed graphs [PDF]
Discrete Mathematics Letters, 2022 Qi Xiong, Gui-Xian Tian, Shu-Yu Cui
doaj +1 more source
Dual targeting of RET and SRC synergizes in RET fusion‐positive cancer cells
Molecular Oncology, EarlyView.Despite the strong activity of selective RET tyrosine kinase inhibitors (TKIs), resistance of RET fusion‐positive (RET+) lung cancer and thyroid cancer frequently occurs and is mainly driven by RET‐independent bypass mechanisms. Son et al. show that SRC TKIs significantly inhibit PAK and AKT survival signaling and enhance the efficacy of RET TKIs in ...
Juhyeon Son +13 more
wiley +1 more source