Laplacian coefficient, matching polynomial and incidence energy of trees with described maximum degree
Ya-Lei Jin,
Yeong-Nan Yeh and
Xiao-Dong Zhang ()
Additional contact information
Ya-Lei Jin: Shanghai Jiao Tong University
Yeong-Nan Yeh: Academia Sinica
Xiao-Dong Zhang: Shanghai Jiao Tong University
Journal of Combinatorial Optimization, 2016, vol. 31, issue 3, No 25, 1345-1372
Abstract:
Abstract Let $$\mathcal {L}(T,\lambda )=\sum _{k=0}^n (-1)^{k}c_{k}(T)\lambda ^{n-k}$$ L ( T , λ ) = ∑ k = 0 n ( - 1 ) k c k ( T ) λ 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, \ldots , c_n)$$ ( c 0 , … , 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.
Keywords: Laplacian coefficient; Matching polynomial; Incidence energy; Tree; Subdivision tree; 05C25; 05C50 (search for similar items in EconPapers)
Date: 2016
References: View complete reference list from CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1007/s10878-015-9977-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:31:y:2016:i:3:d:10.1007_s10878-015-9977-4
Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878
DOI: 10.1007/s10878-015-9977-4
Access Statistics for this article
Journal of Combinatorial Optimization is currently edited by Thai, My T.
More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().