2000 character limit reached
Laplacian Coefficient, Matching Polynomial and Incidence Energy of of Trees with Described Maximum Degree (1512.01333v1)
Published 4 Dec 2015 in math.CO
Abstract: Let $\mathcal{L}(T,\lambda)=\sum_{k=0}n(-1){k}c_{k}(T)\lambda{n-k}$ be the characteristic polynomial of its Laplacian matrix of a tree $T$. This paper studied some properties of the generating function of the coefficients sequence $(c_0, \cdots, c_n)$ which are related with the matching polynomials of division tree of $T$. These results, in turn, are used to characterize all extremal trees having the minimum Laplacian coefficient generation function and the minimum incidence energy of trees with described maximum degree, respectively.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.