Results 51 to 60 of about 34,683 (312)

EXTREMAL THEORY OF ORDERED GRAPHS [PDF]

open access: yesProceedings of the International Congress of Mathematicians (ICM 2018), 2019
We call simple graphs with a linear order on the vertices ordered graphs. Turán-type extremal graph theory naturally extends to ordered graphs. This is a survey on the ongoing research in the extremal theory of ordered graphs with an emphasis on open problems.
openaire   +1 more source

Transcriptional network analysis of PTEN‐protein‐deficient prostate tumors reveals robust stromal reprogramming and signs of senescent paracrine communication

open access: yesMolecular Oncology, EarlyView.
Combining PTEN protein assessment and transcriptomic profiling of prostate tumors, we uncovered a network enriched in senescence and extracellular matrix (ECM) programs associated with PTEN loss and conserved in a mouse model. We show that PTEN‐deficient cells trigger paracrine remodeling of the surrounding stroma and this information could help ...
Ivana Rondon‐Lorefice   +16 more
wiley   +1 more source

Maximal tree and unicylic graph for Euler Sombor index with given diameter

open access: yesAKCE International Journal of Graphs and Combinatorics
The study of topological descriptors is essential for understanding the underlying structures of graphs and networks. Numerous numerical descriptors associated with graphs have been used to analyze their overall structure.
Zahid Raza   +3 more
doaj   +1 more source

LDAcoop: Integrating non‐linear population dynamics into the analysis of clonogenic growth in vitro

open access: yesMolecular Oncology, EarlyView.
Limiting dilution assays (LDAs) quantify clonogenic growth by seeding serial dilutions of cells and scoring wells for colony formation. The fraction of negative wells is plotted against cells seeded and analyzed using the non‐linear modeling of LDAcoop.
Nikko Brix   +13 more
wiley   +1 more source

Choosing Wavelet Methods, Filters, and Lengths for Functional Brain Network Construction. [PDF]

open access: yesPLoS ONE, 2016
Wavelet methods are widely used to decompose fMRI, EEG, or MEG signals into time series representing neurophysiological activity in fixed frequency bands.
Zitong Zhang   +4 more
doaj   +1 more source

Problems in extremal graph theory [PDF]

open access: yes, 2010
We consider a variety of problems in extremal graph and set theory. The {\em chromatic number} of $G$, $\chi(G)$, is the smallest integer $k$ such that $G$ is $k$-colorable.
Ozkahya, Lale
core  

The history of degenerate (bipartite) extremal graph problems [PDF]

open access: yes, 2013
This paper is a survey on Extremal Graph Theory, primarily focusing on the case when one of the excluded graphs is bipartite. On one hand we give an introduction to this field and also describe many important results, methods, problems, and constructions.
A. A. Razborov   +198 more
core   +1 more source

Virtual or In‐Person: Does It Matter? Comparing Pain, Function, Quality of Life, Self‐Efficacy, and Physical Function Outcomes of Virtual, Hybrid, and In‐Person Education and Exercise Program Participants

open access: yesArthritis Care &Research, EarlyView.
Objective This study aimed to determine if program format (in‐person, virtual, or hybrid) results in differences in 3‐month outcomes of pain, function, quality of life, self‐efficacy, and chair stands in a hip/knee osteoarthritis‐management program. Methods A secondary analysis of the Good Life with osteoArthritis in Denmark (GLA:D) Canada database was
Jill Van Damme   +7 more
wiley   +1 more source

Extremal Topological Indices with Prescribed Degree Sequences

open access: yesVestnik KRAUNC: Fiziko-Matematičeskie Nauki
This paper explores the extremal properties and bounds of two significant topological indices in graph theory: the Albertson and Sigma indices, with an emphasis on trees and bipartite graphs.
Hamoud, J., Belov, A.Ya.
doaj   +1 more source

The Lagrangian Density of {123, 234, 456} and the Turán Number of its Extension

open access: yesDiscussiones Mathematicae Graph Theory, 2021
Given a positive integer n and an r-uniform hypergraph F, the Turán number ex(n, F ) is the maximum number of edges in an F -free r-uniform hypergraph on n vertices.
Chen Pingge, Liang Jinhua, Peng Yuejian
doaj   +1 more source

Home - About - Disclaimer - Privacy