Results 51 to 60 of about 34,294 (314)
Rational exponents in extremal graph theory [PDF]
Given a family of graphs \mathcal{H} , the extremal number ex (n, \mathcal{H}) is the largest m for which there exists a graph with n
Bukh, Boris, Conlon, David
openaire +4 more sources
Expanding Hereditary Spastic Paraplegias Limits: Biallelic SPAST Variants in Cerebral Palsy Mimics
ABSTRACT Objective Hereditary spastic paraplegias (HSP) are rare neurodegenerative disorders marked by spasticity and lower limb weakness. The most common type, SPG4, is usually autosomal dominant and caused by SPAST gene variants, typically presenting as pure HSP.
Gregorio A. Nolasco +18 more
wiley +1 more source
Maximal tree and unicylic graph for Euler Sombor index with given diameter
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
Choosing Wavelet Methods, Filters, and Lengths for Functional Brain Network Construction. [PDF]
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
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
The Lagrangian Density of {123, 234, 456} and the Turán Number of its Extension
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
Regularity lemmas in a Banach space setting
Szemer\'edi's regularity lemma is a fundamental tool in extremal graph theory, theoretical computer science and combinatorial number theory. Lov\'asz and Szegedy [L. Lov\'asz and B.
Regts, Guus
core +2 more sources
Extremal problems for the p-spectral radius of graphs [PDF]
The $p$-spectral radius of a graph $G\ $of order $n$ is defined for any real number $p\geq1$ as \[ \lambda^{\left( p\right) }\left( G\right) =\max\left\{ 2\sum_{\{i,j\}\in E\left( G\right) \ }x_{i}x_{j}:x_{1},\ldots,x_{n}\in\mathbb{R}\text{ and }\left ...
Kang, Liying, Nikiforov, Vladimir
core +1 more source
Laser Metal Deposited Ti4822 Hollow Pipe: Experimental and Computational Modelling Study
Laser metal deposition (LMD) of a crack‐free built Ti4822 alloys is challenging. This article reports outstanding characteristics of a hollow pipe that is built with LMD technology when a predicted, nontransformation substrate temperature of 800 °C is used.
Sadiq A. Raji +5 more
wiley +1 more source
Extremal Topological Indices with Prescribed Degree Sequences
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

