Results 71 to 80 of about 96,525 (309)
On clique graphs and clique regular graphs
Discrete MathematicsIf $Γ$ is a graph for which every edge is in exactly one clique of order $ω$, then one can form a new graph with vertex set equal to these cliques. This is a generalization of the line graph of $Γ$. We discover many general results and classifications related to these clique graph that will be useful to researchers studying these objects. In particular,
Robert R. Petro, Connor M. Phillips
openaire +2 more sources
On the approximability of the maximum induced matching problem [PDF]
, 2005 In this paper we consider the approximability of the maximum induced matching problem (MIM). We give an approximation algorithm with asymptotic performance ratio <i>d</i>-1 for MIM in <i>d</i>-regular graphs, for each <i>d ...
Zito, Michele +12 more
core +1 more source
Molecular Oncology, EarlyView.Targeted therapy was evaluated in SHH medulloblastoma using neuroepithelial stem cell (NES) and tumor‐derived NES‐like (tNES) models in 2D monolayers and 3D spheroids. PI3K, AKT, and CDK4/6 inhibitors had minimal effects in NES but markedly reduced viability and growth and induced apoptosis in tNES cells, revealing distinct therapeutic vulnerabilities.
Monika Lukoseviciute +4 more
wiley +1 more source
Edge-regular graphs with regular cliques [PDF]
European Journal of Combinatorics, 2018 We exhibit infinitely many examples of edge-regular graphs that have regular cliques and that are not strongly regular. This answers a question of Neumaier from 1981.
Gary R. W. Greaves, Jack H. Koolen
openaire +3 more sources
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
One note on the number of pairwise non-isomorphic connected regular graphs
Mathematics OpenIn this paper, we give an explicit expression for the number of pairwise non-isomorphic connected regular graphs as well as odd graphs on n vertices, where [Formula: see text] is a positive integer.
Hailin Liu, Liping Zhong, Huixian Xu
doaj +1 more source
Construction of Cospectral Integral Regular Graphs
Discussiones Mathematicae Graph Theory, 2017 Graphs G and H are called cospectral if they have the same characteristic polynomial. If eigenvalues are integral, then corresponding graphs are called integral graph.
Bapat Ravindra B., Karimi Masoud
doaj +1 more source
Distance regular graphs of diameter 3 and strongly regular graphs
Discrete Mathematics, 1984 In a paper by \textit{N. L. Biggs} [Ann. Discrete Math. 15, 69-80 (1982; Zbl 0506.05057)], two parameter sets for distance regular graphs that are antipodal covers of a complete graph were mentioned for which the existence of a corresponding graph was unknown.
openaire +3 more sources
Decomposing random regular graphs into stars
, 2023 We study k-star decompositions, that is, partitions of the edge set into disjoint stars with k edges, in the uniformly random d-regular graph model Gn,d.
Delcourt, Michelle +4 more
core
Molecular Oncology, EarlyView.Pancreatic sensory neurons innervating healthy and PDAC tissue were retrogradely labeled and profiled by single‐cell RNA sequencing. Tumor‐associated innervation showed a dominant neurofilament‐positive subtype, altered mitochondrial gene signatures, and reduced non‐peptidergic neurons.
Elena Genova +14 more
wiley +1 more source