The largest n - 1 Hosoya indices of unicyclic graphs
From MaRDI portal
Publication:5279539
DOI10.2298/FIL1609573YzbMATH Open1403.92352arXiv1105.5522MaRDI QIDQ5279539
Aleksandar Ilić, Guihai Yu, Lihua Feng
Publication date: 19 July 2017
Published in: Filomat (Search for Journal in Brave)
Abstract: The Hosoya index of a graph is defined as the total number of edge independent sets of . In this paper, we extend the research of [J. Ou, On extremal unicyclic molecular graphs with maximal Hosoya index, extit{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, extit{MATCH Commun. Math. Comput. Chem.} 59 (2008) 191--202.] and order the largest unicyclic graphs with respect to the Hosoya index.
Full work available at URL: https://arxiv.org/abs/1105.5522
Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Related Items (1)
This page was built for publication: The largest n - 1 Hosoya indices of unicyclic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5279539)