AbstractIn this paper, we investigated the spectral radius of trees and obtained the following result: Let T be a tree on n vertices. Let M(T) denote one maximum matching of T and |M(T)|=i. Let Ti* be a tree as shown in Fig. 1. Thenρ(T)⩽12(n−i+1+(n−i+1)2−4(n−2i+1)),and equality holds if and only if T=Ti*
summary:Let $A(G)$ be the adjacency matrix of $G$. The characteristic polynomial of the adjacency ma...
summary:Let $A(G)$ be the adjacency matrix of $G$. The characteristic polynomial of the adjacency ma...
summary:Let $A(G)$ be the adjacency matrix of $G$. The characteristic polynomial of the adjacency ma...
AbstractLet Δ(T) and μ(T) denote the maximum degree and the Laplacian spectral radius of a tree T, r...
AbstractDenote by T(n,q,w1,w2,…,wn-1) the set of n-vertex weighted trees with matching number q and ...
AbstractLet T(n, d) be the set of trees on n vertices with diameter d. In this paper, the first d2+1...
AbstractLet G be a graph; its Laplacian matrix is the difference of the diagonal matrix of its verte...
We consider the problem of maximizing the distance spectral radius and a slight generalization there...
AbstractLet T(n,Δ) be the set of all trees on n vertices with a given maximum degree Δ. In this pape...
AbstractThe distance spectral radius ρ(G) of a graph G is the largest eigenvalue of the distance mat...
The spectral radius of a graph is the largest eigenvalue of the adjacency matrix of the graph. Let $...
AbstractIn this paper, we show that of all graphs of order n with matching number β, the graphs with...
AbstractThe distance spectral radius ρ(G) of a graph G is the largest eigenvalue of the distance mat...
AbstractLet T(n,d) be the set of trees on n vertices with diameter d. In this paper, the first d2+1 ...
Abstract. In this paper, the trees with the largest Dirichlet spectral radius among all trees with a...
summary:Let $A(G)$ be the adjacency matrix of $G$. The characteristic polynomial of the adjacency ma...
summary:Let $A(G)$ be the adjacency matrix of $G$. The characteristic polynomial of the adjacency ma...
summary:Let $A(G)$ be the adjacency matrix of $G$. The characteristic polynomial of the adjacency ma...
AbstractLet Δ(T) and μ(T) denote the maximum degree and the Laplacian spectral radius of a tree T, r...
AbstractDenote by T(n,q,w1,w2,…,wn-1) the set of n-vertex weighted trees with matching number q and ...
AbstractLet T(n, d) be the set of trees on n vertices with diameter d. In this paper, the first d2+1...
AbstractLet G be a graph; its Laplacian matrix is the difference of the diagonal matrix of its verte...
We consider the problem of maximizing the distance spectral radius and a slight generalization there...
AbstractLet T(n,Δ) be the set of all trees on n vertices with a given maximum degree Δ. In this pape...
AbstractThe distance spectral radius ρ(G) of a graph G is the largest eigenvalue of the distance mat...
The spectral radius of a graph is the largest eigenvalue of the adjacency matrix of the graph. Let $...
AbstractIn this paper, we show that of all graphs of order n with matching number β, the graphs with...
AbstractThe distance spectral radius ρ(G) of a graph G is the largest eigenvalue of the distance mat...
AbstractLet T(n,d) be the set of trees on n vertices with diameter d. In this paper, the first d2+1 ...
Abstract. In this paper, the trees with the largest Dirichlet spectral radius among all trees with a...
summary:Let $A(G)$ be the adjacency matrix of $G$. The characteristic polynomial of the adjacency ma...
summary:Let $A(G)$ be the adjacency matrix of $G$. The characteristic polynomial of the adjacency ma...
summary:Let $A(G)$ be the adjacency matrix of $G$. The characteristic polynomial of the adjacency ma...
DOI
Add to ORKG