The Hosoya polynomial of double weighted graphs

DOI10.26493/1855-3974.1297.c7czbMath1411.05075OpenAlexW2772094288WikidataQ129369488 ScholiaQ129369488MaRDI QIDQ4629558

Janez Žerovnik, Tina Novak, Darja Rupnik Poklukar

Publication date: 27 March 2019

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/1855-3974.1297.c7c

zbMATH Keywords

Hosoya polynomialWiener numbercommunication networkcactus graphlinear algorithmWiener polynomialedge contributions

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items (2)

A Method for Computing the Edge-Hosoya Polynomial with Application to Phenylenes ⋮ A linear time algorithm for weighted \(k\)-fair domination problem in cactus graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On some counting polynomials in chemistry
• Wiener number of vertex-weighted graphs and a chemical application
• A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
• The obnoxious center problem on weighted cactus graphs.
• Relationship between the Hosoya polynomial and the hyper-Wiener index
• Distance distributions for graphs modeling computer networks
• Mathematical aspects of Wiener index
• WEIGHTED DOMINATION NUMBER OF CACTUS GRAPHS
• Edge-contributions of some topological indices and arboreality of molecular graphs
• Vertex-weighted Wiener polynomials for composite graphs
• Computing Hosoya polynomials of graphs from primary subgraphs

This page was built for publication: The Hosoya polynomial of double weighted graphs