How to Compute the M-Polynomial of (Chemical) Graphs

DOI10.46793/match.89-2.275DzbMath1505.92275OpenAlexW4291536575MaRDI QIDQ5050766

Sandi Klavžar, Emeric Deutsch, Gašper Domen Romih

Publication date: 17 November 2022

Published in: MATCH Communications in Mathematical and in Computer Chemistry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.46793/match.89-2.275d

Mathematics Subject Classification ID

Graph polynomials (05C31) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)

Cites Work

• \(M\)-polynomial revisited: Bethe cacti and an extension of Gutman's approach
• On structure-sensitivity of degree-based topological indices
• M-Polynomial and Degree-Based Topological Indices
• On the M-polynomial of planar chemical graphs
• Extremal Unicyclic Graphs with Respect to Vertex-Degree-Based Topological Indices
• Extremal Graphs for Topological Index Defined by a Degree-Based Edge-Weight Function
• Graphs with Minimum Vertex-Degree Function-Index for Convex Functions
• Trees with Maximum Vertex-Degree-Based Topological Indices
• M-polynomial of some Graph Operations and Cycle Related Graphs

This page was built for publication: How to Compute the M-Polynomial of (Chemical) Graphs