Computing Hosoya polynomials of graphs from primary subgraphs

zbMath1299.05080arXiv1212.3179MaRDI QIDQ5408307

Sandi Klažar, Emeric Deutsch

Publication date: 9 April 2014

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

Mathematics Subject Classification ID

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

Related Items (18)

TOTAL DOMINATION POLYNOMIAL OF GRAPHS FROM PRIMARY SUBGRAPHS ⋮ Universal lines in graphs ⋮ The distinguishing number and the distinguishing index of graphs from primary subgraphs ⋮ On the dominated chromatic number of certain graphs ⋮ A Method for Computing the Edge-Hosoya Polynomial with Application to Phenylenes ⋮ Unnamed Item ⋮ The edge-Hosoya polynomial of benzenoid chains ⋮ The Hosoya polynomial of double weighted graphs ⋮ Computing the metric dimension of a graph from primary subgraphs ⋮ On the geometric-arithmetic index by decompositions -- CMMSE ⋮ The terminal Hosoya polynomial of some families of composite graphs ⋮ Hosoya polynomial of some cactus chains ⋮ The Hosoya polynomial of distance-regular graphs ⋮ Anti-forcing number of some specific graphs ⋮ Mostar index and edge Mostar index of polymers ⋮ \(M\)-polynomial revisited: Bethe cacti and an extension of Gutman's approach ⋮ Computation of Gutman index of some cactus chains ⋮ Unnamed Item

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