Results 241 to 250 of about 2,710,086 (272)

Characterizing star factors via the size, the spectral radius or the distance spectral radius of graphs

Discrete Applied Mathematics, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shuchao Li, Shujing Miao
exaly   +4 more sources

On the distance spectral radius of trees

Linear and Multilinear Algebra, 2013
In this article, we prove that among trees on n vertices and matching number m, the dumbbell is the unique tree that maximizes the distance spectral radius, which was conjectured by Aleksandar Ilic [Distance spectral radius of trees with given matching number, Discr. Appl. Math. 158 (2010), pp. 1799–1806].
Somnath Paul, Milan Nath
exaly   +2 more sources

On distance spectral radius of uniform hypergraphs with cycles

Discrete Applied Mathematics, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hongying Lin, Bo Zhou
exaly   +3 more sources

On adjacency-distance spectral radius and spread of graphs

Applied Mathematics and Computation, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bo Zhou
exaly   +2 more sources

On the distance spectral radius and the distance energy of graphs

Linear and Multilinear Algebra, 2011
The D-eigenvalues {μ1, μ2, … , μ p } of a connected graph G are the eigenvalues of its distance matrix D. The D-energy of a graph G is the sum of the absolute values of its D-eigenvalues denoted by E D (G). In this article, we obtain a lower bound for the largest D-eigenvalue of G and an upper bound for E D (G) which improve Indulal's bounds [G ...
Gungor, A. Dilek, Bozkurt, S. Burca
exaly   +3 more sources

ON THE SIZE, SPECTRAL RADIUS, DISTANCE SPECTRAL RADIUS AND FRACTIONAL MATCHINGS IN GRAPHS

Bulletin of the Australian Mathematical Society, 2023
AbstractWe first establish a lower bound on the size and spectral radius of a graph G to guarantee that G contains a fractional perfect matching. Then, we determine an upper bound on the distance spectral radius of a graph G to ensure that G has a fractional perfect matching.
SHUCHAO LI, SHUJING MIAO, MINJIE ZHANG
openaire   +2 more sources

GRAPH TRANSFORMATION AND DISTANCE SPECTRAL RADIUS

Discrete Mathematics, Algorithms and Applications, 2013
Trees are very common in the theory and applications of combinatorics. In this paper, we consider graphs whose underlying structure is a tree and study the behavior of the distance spectral radius under a graph transformation. As an application, we find the corona tree that maximizes the distance spectral radius among all corona trees with a fixed ...
Milan Nath, Somnath Paul
openaire   +1 more source

Maximal distance spectral radius of trees

Discrete Mathematics, Algorithms and Applications, 2019
In this paper, we determine the unique tree that maximizes the distance spectral radius in the class of all trees in which each non-pendent vertex has degree at least [Formula: see text].
S. S. Bose, Milan Nath, Deepak Sarma
openaire   +2 more sources

On generalized distance spectral radius and generalized distance energy of graphs

Discrete Mathematics, Algorithms and Applications, 2022
For a simple connected graph [Formula: see text], let [Formula: see text] and [Formula: see text] be the distance matrix and the diagonal matrix of the vertex transmissions, respectively. The convex linear combination [Formula: see text] of [Formula: see text] and [Formula: see text] is defined as, [Formula: see text], [Formula: see text]. The matrix [
Zia Ullah Khan, Xiao-Dong Zhang 0001
openaire   +2 more sources