\(M\)-polynomial revisited: Bethe cacti and an extension of Gutman's approach

DOI10.1007/s12190-018-1212-xzbMath1417.05034arXiv1806.08183OpenAlexW2808732146WikidataQ129387913 ScholiaQ129387913MaRDI QIDQ2318311

Emeric Deutsch, Sandi Klavžar

Publication date: 14 August 2019

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

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

zbMATH Keywords

graph polynomialdegree-based topological indexbond incident degree index\(M\)-polynomialBethe cacti

Mathematics Subject Classification ID

Graph polynomials (05C31) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Vertex degrees (05C07)

Related Items (4)

How to Compute the M-Polynomial of (Chemical) Graphs ⋮ On the M-polynomial of planar chemical graphs ⋮ Extremal polygonal cacti for bond incident degree indices ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The variation of the Randić index with regard to minimum and maximum degree
• Sufficient conditions on the zeroth-order general Randić index for maximally edge-connected graphs
• On some counting polynomials in chemistry
• Partial orthogonal rank-one decomposition of complex symmetric tensors based on the Takagi factorization
• Degree-based topological indices of hexagonal nanotubes
• Some computational aspects of boron triangular nanotubes
• Stirling Numbers and Generalized Zagreb Indices
• M-Polynomial and Degree-Based Topological Indices
• Inverse degree, Randic index and harmonic index of graphs
• Relationship Between the Hosoya Polynomial and the Edge-Hosoya Polynomial of Trees
• Computing Hosoya polynomials of graphs from primary subgraphs

This page was built for publication: \(M\)-polynomial revisited: Bethe cacti and an extension of Gutman's approach