Results 251 to 260 of about 339,685 (278)

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 ...
Nath, Milan, Paul, Somnath
openaire   +1 more source

Some Properties on Resistance Distance Spectral Radius

Bulletin of the Iranian Mathematical Society, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhu, Zhongxun, He, Fangguo
openaire   +2 more sources

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].
Bose, S. S., Nath, M., Sarma, D.
openaire   +2 more sources

The distance spectral radius of trees

Linear and Multilinear Algebra, 2017
The unique graphs with maximum distance spectral radius among trees with given number of vertices of maximum degree and among homeomorphically irreducible trees, respectively, are determined.
Hongying Lin, Bo Zhou
openaire   +1 more source

On distance spectral radius of hypergraphs

Linear and Multilinear Algebra, 2017
AbstractThe distance spectral radius of a connected hypergraph is the largest eigenvalue of its distance matrix. We propose some graft transformations that decrease or increase the distance spectral radius of a connected hypergraph that is not necessarily uniform. Then we determine the unique hypertrees with minimum and maximum distance spectral radius,
Yanna Wang, Bo Zhou
openaire   +1 more source

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
openaire   +2 more sources

On the distance Laplacian spectral radius of bicyclic graphs

Linear and Multilinear Algebra, 2021
The distance Laplacian matrix of a connected graph G is defined as L(G)=Tr(G)−D(G), where Tr(G) is the diagonal matrix of the vertex transmissions in G and D(G) is the distance matrix of G.
Nannan Xu, Aimei Yu, Rong-Xia Hao
openaire   +1 more source

Distance Spectral Radius and Edge-Disjoint Spanning Trees

Discrete Applied Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fan, Dandan, He, Rumeng, Zhao, Yanhua
openaire   +2 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.
Guo, Haiyan, Zhou, Bo
openaire   +1 more source

A NOTE ON THE DISTANCE SPECTRAL RADIUS OF SOME GRAPHS

Discrete Mathematics, Algorithms and Applications, 2014
We characterize graphs with minimal distance spectral radius in two classes of graphs: with vertex connectivity k and minimum degree at least k, and with given number of blocks. Moreover, we determine the unique graph that maximizes the distance spectral radius among all graphs with given clique number.
Nath, Milan, Paul, Somnath
openaire   +2 more sources