Skip to the main content

Original scientific paper

Graphs Having the Maximal Value of the Szeged Index

Audrey A. Dobrynin ; Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk 630090, Russia


Full text: english pdf 6.108 Kb

page 819-825

downloads: 391

cite


Abstract

The Szeged index is a new topological index based on distances between the vertices of a graph. The conjecture of Klavžar, Rajapakse and Gutman concerning graphs with the maximal value of the Szeged index is proved. More precisely, a complete bipartite graph K[p/2],[(p+l)/2] has the maximum Szeged index among all the connected graphs on p vertices.

Keywords

Hrčak ID:

135649

URI

https://hrcak.srce.hr/135649

Publication date:

1.9.1997.

Visits: 943 *