•  
  •  
 

Keywords

Estrada Indices; Perfect Matching; Trees

Abstract

Let $\mathcal{H}_{n}$ be the set of the trees having a perfect matching with $n$ vertices. The ordering of the trees in $\mathcal{H}_{n}$ according to their minimal Estrada indices is investigated. We obtain the trees with the smallest and the second smallest Estrada indices among $\mathcal{H}_{n}$ with $n\geq 6$.

abs_vol31_pp134-146.pdf (24 kB)
Abstract

Share

COinS
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.