Hosoya entropy of fullerene graphs

DOI10.1016/j.amc.2019.01.024zbMath1428.05245OpenAlexW2913595436WikidataQ128423643 ScholiaQ128423643MaRDI QIDQ2010674

Frank Emmert-Streib, Abbe Mowshowitz, Matthias Dehmer, Mina Rajabi-Parsa, Modjtaba Ghorbani

Publication date: 27 November 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2019.01.024

zbMATH Keywords

graph entropygraph automorphismfullerene graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Vertex degrees (05C07)

Related Items

Novel results on partial Hosoya polynomials: an application in chemistry, On the zeros of the partial Hosoya polynomial of graphs, On the relationship between PageRank and automorphisms of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Hosoya entropy of a graph
• A history of graph entropy measures
• Graph distance measures based on topological indices revisited
• An upper bound for the Clar number of fullerene graphs
• On some counting polynomials in chemistry
• Degree-based entropies of networks revisited
• Network entropies based on independent sets and matchings
• Relationship between the Hosoya polynomial and the hyper-Wiener index
• Vertex-weighted Wiener polynomials for composite graphs
• Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
• Entropy and the complexity of graphs: II. The information content of digraphs and infinite graphs
• Entropy and the complexity of graphs: III. Graphs with prescribed information content
• Entropy and the complexity of graphs: IV. Entropy measures and graphical structure