Abstract
The conjecture of Graham and Lovász that the (normalized) coefficients of the distance characteristic polynomial of a tree are unimodal is proved; it is also shown that the (normalized) coefficients are log-concave. Upper and lower bounds on the location of the peak are established.
| Original language | English |
|---|---|
| Article number | 27 |
| Pages (from-to) | 373-380 |
| Number of pages | 8 |
| Journal | Electronic Journal of Linear Algebra |
| Volume | 34 |
| DOIs | |
| Publication status | Published - Aug 2018 |
| Externally published | Yes |
Funding
Acknowledgment. We thank Ben Braun, Steve Butler, Jay Cummings, Jessica De Silva, Wei Gao, and Kristin Heysse for stimulating discussions, and gratefully acknowledge financial support for this research from NSF 1500662, Elsevier, and the International Linear Algebra Society. We thank the Graduate Research Workshop in Combinatorics (GRWC) where this research took place and the Institute for Mathematics and its Applications (IMA) where connections essential to this research were built.
Keywords
- Characteristic polynomial
- Distance matrix
- Log-concave
- Unimodal
Fingerprint
Dive into the research topics of 'Proof of a conjecture of Graham and Lovász concerning unimodality of coefficients of the distance characteristic polynomial of a tree'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver