English

The largest $n-1$ Hosoya indices of unicyclic graphs

Combinatorics 2011-05-30 v1

Abstract

The Hosoya index Z(G)Z (G) of a graph GG is defined as the total number of edge independent sets of GG. In this paper, we extend the research of [J. Ou, On extremal unicyclic molecular graphs with maximal Hosoya index, \textit{Discrete Appl. Math.} 157 (2009) 391--397.] and [Y. Ye, X. Pan, H. Liu, Ordering unicyclic graphs with respect to Hosoya indices and Merrifield-Simmons indices, \textit{MATCH Commun. Math. Comput. Chem.} 59 (2008) 191--202.] and order the largest n1n-1 unicyclic graphs with respect to the Hosoya index.

Keywords

Cite

@article{arxiv.1105.5522,
  title  = {The largest $n-1$ Hosoya indices of unicyclic graphs},
  author = {Guihai Yu and Lihua Feng and Aleksandar Ilic},
  journal= {arXiv preprint arXiv:1105.5522},
  year   = {2011}
}

Comments

10 pages, 4 figures