Computing Hosoya polynomials of graphs from primary subgraphs
Preprint
Abstract
The Hosoya polynomial of a graph encompasses many of its metric properties, for instance the Wiener index (alias average distance) and the hyper-Wiener index. An expression is obtained that reduces the computation of the Hosoya polynomials of a graph with cut vertices to the Hosoya polynomial of the so-called primary subgraphs. The main theorem is applied to specific constructions including bouquets of graphs, circuits of graphs and link of graphs. This is in turn applied to obtain the Hosoya polynomial of several chemically relevant families of graphs. In this way numerous known results are generalized and an approach to obtain them is simplified. Along the way several misprints from the literature are corrected.Keywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Wiener indices of spiro and polyphenyl hexagonal chainsMathematical and Computer Modelling, 2012
- Computation of Topological Indices of Some GraphsActa Applicandae Mathematicae, 2009
- Wiener, hyper-Wiener, detour and hyper-detour indices of bridge and chain graphsJournal of Mathematical Chemistry, 2009
- Wiener index of graphs with more than one cut-vertexApplied Mathematics Letters, 2008
- The Hosoya polynomial decomposition for catacondensed benzenoid graphsDiscrete Applied Mathematics, 2008
- Hosoya polynomials under gated amalgamationsDiscrete Applied Mathematics, 2008
- The behavior of Wiener indices and polynomials of graphs under five graph decorationsApplied Mathematics Letters, 2007
- Hosoya polynomials of armchair open‐ended nanotubesInternational Journal of Quantum Chemistry, 2006
- Hosoya polynomial of composite graphsDiscrete Mathematics, 2001
- On some counting polynomials in chemistryDiscrete Applied Mathematics, 1988