7 papers
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…
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…
Computing weighted Szeged and PI indices from quotient graphs
Niko Tratnik
The weighted Szeged index and the weighted vertex-PI index of a connected graph are defined as and $wPI_v(G) = \…
Computing the Mostar index in networks with applications to molecular graphs
Niko Tratnik
Recently, a bond-additive topological descriptor, named as the Mostar index, has been introduced as a measure of peripherality in networks. For a connected graph , the Mostar in…
Generalized cut method for computing the edge-Wiener index
Niko Tratnik
The edge-Wiener index of a connected graph is defined as the Wiener index of the line graph of . In this paper it is shown that the edge-Wiener index of an edge-weighted gra…
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…