Computing the Hosoya polynomial of graphs from primary subgraphs

MaRDI QIDQ5408307zbMATH OpenFDO

Authors Emeric Deutsch, Sandi Klažar

Publication date 9 April 2014

Full work available at URL https://arxiv.org/abs/1212.3179

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph polynomials (05C31) Applications of graph theory (05C90)

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.

Recommendations

• Hosoya polynomial of composite graphs
• Hosoya polynomials of circumcoronene series
• scientific article; zbMATH DE number 1890132
• The Hosoya polynomial of double weighted graphs
• Hosoya polynomial of some cactus chains

Cited in

(27)

• The edge-Hosoya polynomial of benzenoid chains
• Mostar index and edge Mostar index of polymers
• The terminal Hosoya polynomial of some families of composite graphs
• \(M\)-polynomial revisited: Bethe cacti and an extension of Gutman's approach
• Computation method of the Hosoya index of primitive coronoid systems
• Anti-forcing number of some specific graphs
• The Hosoya polynomial of double weighted graphs
• A Graph Polynomial Approach to Primitivity
• TOTAL DOMINATION POLYNOMIAL OF GRAPHS FROM PRIMARY SUBGRAPHS
• The distinguishing number and the distinguishing index of graphs from primary subgraphs
• On the dominated chromatic number of certain graphs
• Computation of Gutman index of some cactus chains
• Computing the metric dimension of a graph from primary subgraphs
• Universal lines in graphs
• Hosoya polynomial of the subdivided join
• On the Estrada index of point attaching strict \(k\)-quasi tree graphs
• Hosoya polynomial of some cactus chains
• scientific article; zbMATH DE number 7655727 (Why is no real title available?)
• A Method for Computing the Edge-Hosoya Polynomial with Application to Phenylenes
• The edge-Hosoya polynomial of catacondensed benzenoid graphs associated with its Hosoya polynomial
• On the geometric-arithmetic index by decompositions -- CMMSE
• Strong domination number of graphs from primary subgraphs
• Some results on the super domination number of a graph. II
• Pebbling number of polymers
• Further results on computation of topological indices of certain networks
• A graph related to the Euler function
• The Hosoya polynomial of distance-regular graphs

This page was built for publication: Computing the Hosoya polynomial of graphs from primary subgraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408307)