AbstractA semiregular tree is a tree where all non-pendant vertices have the same degree. Among all semiregular trees with fixed order and degree, a graph with minimal (adjacency/Laplacian) spectral radius is a caterpillar. Counter examples show that the result cannot be generalized to the class of trees with a given (non-constant) degree sequence
AbstractWe investigate the structure of trees that have minimal algebraic connectivity among all tre...
Abstract In this paper, we investigate the structures of extremal trees which have the minimal numbe...
Let C(n,k) be the set of all unicyclic graphs with n vertices and cycle length k. For any U∈C(n,k), ...
AbstractA semiregular tree is a tree where all non-pendant vertices have the same degree. Among all ...
provided by the University Library and the IT-Services. The aim is to enable open access to the scho...
The spectral radius of a graph is the largest eigenvalue of the adjacency matrix of the graph. Let $...
AbstractIn this paper, we characterize all extremal trees with the largest Laplacian spectral radius...
We consider the problem of maximizing the distance spectral radius and a slight generalization there...
In this note, we consider the trees (caterpillars) that minimize the number of subtrees among trees ...
We observed the effects on the spectral radius of submatrices of the Laplacian matrix L for a tree b...
AbstractLet G be a graph; its Laplacian matrix is the difference of the diagonal matrix of its verte...
AbstractIn [J. Molitierno, The spectral radius of submatrices of Laplacian matrices for trees and it...
The distance spectral radius of a connected graph is the largest eigenvalue of its distance matrix. ...
AbstractLet G be a simple undirected n-vertex graph with the characteristic polynomial of its Laplac...
Abstract. In this paper, the trees with the largest Dirichlet spectral radius among all trees with a...
AbstractWe investigate the structure of trees that have minimal algebraic connectivity among all tre...
Abstract In this paper, we investigate the structures of extremal trees which have the minimal numbe...
Let C(n,k) be the set of all unicyclic graphs with n vertices and cycle length k. For any U∈C(n,k), ...
AbstractA semiregular tree is a tree where all non-pendant vertices have the same degree. Among all ...
provided by the University Library and the IT-Services. The aim is to enable open access to the scho...
The spectral radius of a graph is the largest eigenvalue of the adjacency matrix of the graph. Let $...
AbstractIn this paper, we characterize all extremal trees with the largest Laplacian spectral radius...
We consider the problem of maximizing the distance spectral radius and a slight generalization there...
In this note, we consider the trees (caterpillars) that minimize the number of subtrees among trees ...
We observed the effects on the spectral radius of submatrices of the Laplacian matrix L for a tree b...
AbstractLet G be a graph; its Laplacian matrix is the difference of the diagonal matrix of its verte...
AbstractIn [J. Molitierno, The spectral radius of submatrices of Laplacian matrices for trees and it...
The distance spectral radius of a connected graph is the largest eigenvalue of its distance matrix. ...
AbstractLet G be a simple undirected n-vertex graph with the characteristic polynomial of its Laplac...
Abstract. In this paper, the trees with the largest Dirichlet spectral radius among all trees with a...
AbstractWe investigate the structure of trees that have minimal algebraic connectivity among all tre...
Abstract In this paper, we investigate the structures of extremal trees which have the minimal numbe...
Let C(n,k) be the set of all unicyclic graphs with n vertices and cycle length k. For any U∈C(n,k), ...
DOI
Add to ORKG