Generalized Cut Method for Computing Szeged–Like Polynomials with Applications to Polyphenyls and Carbon Nanocones

DOI10.46793/match.90-2.401bzbMath1519.92351MaRDI QIDQ6112662

Simon Brezovnik, Niko Tratnik

Publication date: 10 July 2023

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

Mathematics Subject Classification ID

Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Chemical graph theory (05C92)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Use of the Szeged index and the revised Szeged index for measuring network bipartivity
• Distance-based topological indices of the tree-like polyphenyl systems
• PI polynomials of product graphs
• On some counting polynomials in chemistry
• Mostar index
• On the Co-PI and Laplacian Co-PI eigenvalues of a graph
• The hexagonal chains with the first three maximal Mostar indices
• Mostar index: results and perspectives
• Distance-unbalancedness of graphs
• The weighted vertex PI index
• On Szeged polynomial of a graph
• On the extremal values for the Mostar index of trees with given degree sequence
• Szeged and Mostar root-indices of graphs
• Computing the Mostar index in networks with applications to molecular graphs
• Szeged-Like Topological Indices and the Efficacy of the Cut Method: The Case of Melem Structures
• Trinajstić Index

This page was built for publication: Generalized Cut Method for Computing Szeged–Like Polynomials with Applications to Polyphenyls and Carbon Nanocones