Results 11 to 20 of about 2,710,086 (272)
Distance spectral radius of trees with given matching number [PDF]
Discrete Applied Mathematics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aleksandar Ilić
exaly +4 more sources
On the distance spectral radius of cacti [PDF]
Linear Algebra and its Applications, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bose, Surya Sekhar +2 more
openaire +3 more sources
On graft transformations decreasing distance spectral radius of graphs [PDF]
RAIRO - Operations Research, 2021 The distance spectral radius of a connected graph is the largest eigenvalue of its distance matrix. In this paper, we give several less restricted graft transformations that decrease the distance spectral radius, and determine the unique graph with minimum distance spectral radius among home-omorphically irreducible unicylic graphs on n ≥ 6 vertices ...
Yanna Wang, Bo Zhou 0007
openaire +3 more sources
The spectral radius and the distance spectral radius of complements of block graphs [PDF]
In this paper, we determine the graphs whose spectral radius and distance spectral radius attain maximum and minimum among all complements of clique trees. Furthermore, we also determine the graphs whose spectral radius and distance spectral radius attain minimum and maximum among all complements of block graphs, respectively.
Chen, Xu +3 more
core +4 more sources
A proof of a conjecture on the distance spectral radius
Linear Algebra and its Applications, 2023 A cactus is a connected graph in which any two cycles have at most one common vertex. We determine the unique graph that maximizes the distance spectral radius over all cacti with fixed numbers of vertices and cycles, and thus prove a conjecture on the distance spectral radius of cacti in [S.S. Bose, M. Nath, S. Paul, On the distance spectral radius of
Yanna Wang, Bo Zhou
openaire +4 more sources
Distance spectral radius of series-reduced trees with parameters [PDF]
RAIRO - Operations Research, 2021 For a connected graph G, the distance matrix is a real-symmetric matrix where the (u, v)-entry is the distance between vertex u and vertex v in G. The distance spectral radius of G is the largest eigenvalue of the distance matrix of G. A series-reduced tree is a tree with at least one internal vertex and all internal vertices having degree at least ...
Yuyuan Deng +3 more
openaire +2 more sources
Matching extension and distance spectral radius [PDF]
Linear Algebra and its Applications, 2023 A graph is called $k$-extendable if each $k$-matching can be extended to a perfect matching. We give spectral conditions for the $k$-extendability of graphs and bipartite graphs using Tutte-type and Hall-type structural characterizations. Concretely, we give a sufficient condition in terms of the spectral radius of the distance matrix for the $k ...
Yuke Zhang, Edwin R. van Dam
core +5 more sources
Bounds for resistance-distance spectral radius
, 2013 Lower and upper bounds as well as Nordhause-Gaddum-type results for the resistance-distance spectral radius are obtained.
Maden, A. Dilek Gungor +2 more
core +6 more sources
On the distance spectral radius of bipartite graphs [PDF]
Linear Algebra and its Applications, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nath, Milan, Paul, Somnath
openaire +2 more sources
On the distance spectral radius of some graphs [PDF]
Linear Algebra and its Applications, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang, Xiaoling
openaire +2 more sources