36 citations · 181 across the 21 of their papers we have counts for
5 papers · 1 filter
A Method for Computing the Edge-Hyper-Wiener Index of Partial Cubes and an Algorithm for Benzenoid Systems
Niko Tratnik
The edge-hyper-Wiener index of a connected graph is defined as $WW_e(G) = \frac{1}{2}\sum_{\lbrace e,f\rbrace \subseteq E(G)}d(e,f) + \frac{1}{2}\sum_{\lbrace e,f\rbrace \subse…
Relationship Between the Hosoya Polynomial and the Edge-Hosoya Polynomial of Trees
Niko Tratnik, Petra Žigert Pleteršek
We prove the relationship between the Hosoya polynomial and the edge-Hosoya polynomial of trees. The connection between the edge-hyper-Wiener index and the edge-Hosoya polynomial i…
The Szeged Index and the Wiener Index of Partial Cubes with Applications to Chemical Graphs
Matevz Crepnjak, Niko Tratnik
In this paper we study the Szeged index of partial cubes and hence generalize the result proved by V. Chepoi and S. Klavžar, who calculated this index for benzenoid systems. It is…
The Edge-Szeged Index and the PI Index of Benzenoid Systems in Linear Time
Niko Tratnik
The edge-Szeged index of a graph is defined as , where denotes the number of edges of whose distance to is smaller…
Uniquely identifying the edges of a graph: the edge metric dimension
Aleksander Kelenc, Niko Tratnik, Ismael G. Yero
Let be a connected graph, let be a vertex and let be an edge. The distance between the vertex and the edge is given by $d_G(e,v)=\min\{d_G(u,…