activity
20182020
collaborators

5 papers

math.CO2020

General cut method for computing Szeged-like topological indices with applications to molecular graphs

Simon Brezovnik, Niko Tratnik

Szeged, PI and Mostar indices are some of the most investigated distance-based molecular descriptors. Recently, many different variations of these topological indices appeared in t…

math.CO2020

Grundy domination and zero forcing in regular graphs

Boštjan Brešar, Simon Brezovnik

Given a finite graph , the maximum length of a sequence of vertices in such that each dominates a vertex that is not dominated by any vertex in $\{v…

math.CO2019

Resonance graphs of catacondensed even ring systems

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

A catacondensed even ring system (shortly CERS) is a simple bipartite 2-connected outerplanar graph with all vertices of degree 2 or 3. In this paper, we investigate the resonance…

math.CO2019

Resonantly Equivalent Catacondensed Even Ring Systems

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

In this paper we generalize the binary coding procedure of perfect matchings from catacondensed benzenoid graphs to catacondensed even ring systems (also called cers). Next, we stu…

math.CO2018

New methods for calculating the degree distance and the Gutman index

Simon Brezovnik, Niko Tratnik

In the paper we develop new methods for calculating the two well-known topological indices, the degree-distance and the Gutman index. Firstly, we prove that the Wiener index of a d…