The largest n-1 Hosoya indices of unicyclic graphs

2011/05/27 by Guihai Yu, Lihua Feng, Yu, Guihai +3
Mathematics · Computer Science · Chemistry · #Graph theory and applications #Computational Drug Discovery Methods #Synthesis and Properties of Aromatic Compounds

paper · pdf · doi:10.48550/arxiv.1105.5522

Abstract

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, 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, MATCH Commun. Math. Comput. Chem. 59 (2008) 191--202.] and order the largest n-1 unicyclic graphs with respect to the Hosoya index.

Related

• Computing Hosoya polynomials of graphs from primary subgraphs
• Subtrees and independent subsets in unicyclic graphs and unicyclic graphs with fixed segment sequence
• The Wiener Index and the Hosoya Polynomial of the Jahangir Graphs
• Hosoya Polynomials of Mycielskian Graphs
• The Hyper-Zagreb Index of Trees and Unicyclic Graphs