7 citations · 33 across the 17 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
math.CO2019
A relaxed version of Šoltés's problem and cactus graphs
Jan Bok, Nikola Jedličková, Jana Maxová
The \emph{Wiener index} is one of the most widely studied parameters in chemical graph theory. It is defined as the sum of the lengths of the shortest paths between all unordered p…
math.CO2019★ 4 cited
Maximum Wiener index of unicyclic graphs with given bipartition
Jan Bok, Nikola Jedličková, Jana Maxová
The \emph{Wiener index} is a widely studied topological index of graphs. One of the main problems in the area is to determine which graphs of given properties attain the extremal v…
math.CO2019★ 7 cited
On Extremal Graphs of Weighted Szeged Index
Jan Bok, Boris Furtula, Nikola Jedličková +1
An extension of the well-known Szeged index was introduced recently, named as weighted Szeged index (). This paper is devoted to characterizing the extremal trees a…