2 papers
math.CO2025
Efficient graph similarity assessment method based on vectors of topological indices
Matthias Dehmer, Izudin RedžepoviÄ, Niko Tratnik +1
Measuring similarity between complex objects is a fundamental task in many scientific fields. When objects are represented as graphs, graph similarity/distance measures offer a pow…
math.CO2024
On the Wiener-like root-indices of graphs
Simon Brezovnik, Matthias Dehmer, Niko Tratnik +1
In this paper, we examine roots of graph polynomials where those roots can be considered as structural graph measures. More precisely, we prove analytical results for the roots of…