hrcak mascot   Srce   HID

Izvorni znanstveni članak

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

Puni tekst: engleski, pdf (6 MB) str. 819-825 preuzimanja: 176* citiraj
APA 6th Edition
Dobrynin, A.A. (1997). Graphs Having the Maximal Value of the Szeged Index. Croatica Chemica Acta, 70 (3), 819-825. Preuzeto s https://hrcak.srce.hr/135649
MLA 8th Edition
Dobrynin, Audrey A.. "Graphs Having the Maximal Value of the Szeged Index." Croatica Chemica Acta, vol. 70, br. 3, 1997, str. 819-825. https://hrcak.srce.hr/135649. Citirano 21.04.2021.
Chicago 17th Edition
Dobrynin, Audrey A.. "Graphs Having the Maximal Value of the Szeged Index." Croatica Chemica Acta 70, br. 3 (1997): 819-825. https://hrcak.srce.hr/135649
Harvard
Dobrynin, A.A. (1997). 'Graphs Having the Maximal Value of the Szeged Index', Croatica Chemica Acta, 70(3), str. 819-825. Preuzeto s: https://hrcak.srce.hr/135649 (Datum pristupa: 21.04.2021.)
Vancouver
Dobrynin AA. Graphs Having the Maximal Value of the Szeged Index. Croatica Chemica Acta [Internet]. 1997 [pristupljeno 21.04.2021.];70(3):819-825. Dostupno na: https://hrcak.srce.hr/135649
IEEE
A.A. Dobrynin, "Graphs Having the Maximal Value of the Szeged Index", Croatica Chemica Acta, vol.70, br. 3, str. 819-825, 1997. [Online]. Dostupno na: https://hrcak.srce.hr/135649. [Citirano: 21.04.2021.]

Sažetak
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.

Hrčak ID: 135649

URI
https://hrcak.srce.hr/135649

Posjeta: 294 *