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

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

2011-05-27

arxiv.org/abs/1105.5522v1

Mathematics

Combinatorics

10 pages, 4 figures

Scientific paper

The Hosoya index $Z (G)$ of a graph $G$ is defined as the total number of edge independent sets of $G$. 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 $n-1$ unicyclic graphs with respect to the Hosoya index.

Affiliated with

Also associated with

No associations

Rating

The largest $n-1$ Hosoya indices of unicyclic graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The largest $n-1$ Hosoya indices of unicyclic graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The largest $n-1$ Hosoya indices of unicyclic graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-665172