Szeged and Mostar root-indices of graphs

DOI10.1016/j.amc.2022.127736OpenAlexW4311777982MaRDI QIDQ2700357

Matthias Dehmer, Simon Brezovnik, Niko Tratnik, Petra Žigert Pleteršek

Publication date: 21 April 2023

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

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

zbMATH Keywords

sensitivitySzeged indexdiscrimination powerSzeged polynomialMostar polynomialroot-index

Mathematics Subject Classification ID

Graph polynomials (05C31) Convergence and divergence of series and sequences (40A05) Distance in graphs (05C12) 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)

Related Items (1)

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

Cites Work

• Probabilistic inequalities for evaluating structural network measures
• A history of graph entropy measures
• Encoding structural information uniquely with polynomial-based descriptors by employing the Randić matrix
• A survey of graph edit distance
• On some counting polynomials in chemistry
• Mostar index
• Relations and bounds for the zeros of graph polynomials using vertex orbits
• Mostar index: results and perspectives
• On structure-sensitivity of degree-based topological indices
• On Szeged polynomial of a graph
• A distance measure between attributed relational graphs for pattern recognition

This page was built for publication: Szeged and Mostar root-indices of graphs