A new characterization of the set of Laplacian spectral radii of trees

Abstract

For any positive integer r and real number α>1, let Lr(α) denote the set of positive real numbers defined recursively: α-1∈ Lr(α), and for any multi-subset \q1,q2,…,qs\ of Lr(α), where 0<s<r, β:=α-1-s-Σi=1sqi-1 belongs to Lr(α) as long as β>0. We show that (α-1)-1∈ Lr(α) if and only if there exists a tree T with its maximum degree (T) r and Laplacian spectral radius μ(T)=α>1. It follows that the set of Laplacian spectral radii of non-trivial trees is exactly the set of real numbers α 2 such that (α-1)-1∈ Lr(α) for r=α-1. Applying this conclusion, we then show that for any integer n, there exists a tree T with (T)<n and μ(T)=n+1 if and only if n 4.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…