2011Unpublished venueRequires access

Upper bounds on the spectral radius of k trees

Jinlong Shu

Open publisher page 7 citations

Abstract

Hong Yuan characterized the k tree with the largest spectral radius.In this paper,a parameter l(G) of k tree is defined,by which k trees with the second and the third largest spectral radius are obtained.

About this research paper

What this paper is about

Hong Yuan characterized the k tree with the largest spectral radius.In this paper,a parameter l(G) of k tree is defined,by which k trees with the second and the third largest spectral radius are obtained.

Why it matters

OpenAlex reports 7 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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

Hong Yuan characterized the k tree with the largest spectral radius.In this paper,a parameter l(G) of k tree is defined,by which k trees with the second and the third largest spectral radius are obtained.

Key concepts: Mathematics, Spectral radius, RADIUS, Tree (set theory), Combinatorics, Upper and lower bounds, Mathematical analysis, Physics

Related papers

Back to paper searchBrowse research topicsOriginal source
Upper bounds on the spectral radius of k trees — Research Paper | ScholarLens