2009•Journal of Mathematical Research and ExpositionRequires access

Maximizing Spectral Radius of Trees with Given Maximal Degree

Fan Zheng, Ming Qiao Zhu

Open publisher page 0 citations

Abstract

In this paper, we characterize the trees with the largest Laplacian and adjacency spectral radii among all trees with fixed number of vertices and fixed maximal degree, respec- tively.

About this research paper

What this paper is about

In this paper, we characterize the trees with the largest Laplacian and adjacency spectral radii among all trees with fixed number of vertices and fixed maximal degree, respec- tively.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In this paper, we characterize the trees with the largest Laplacian and adjacency spectral radii among all trees with fixed number of vertices and fixed maximal degree, respec- tively.

Key concepts: Mathematics, Degree (music), Spectral radius, Combinatorics, RADIUS, Tree (set theory), Discrete mathematics, Eigenvalues and eigenvectors

Related papers

Back to paper searchBrowse research topicsOriginal source
Maximizing Spectral Radius of Trees with Given Maximal Degree — Research Paper | ScholarLens