CONNECTED GRAPHS OF DIAMETER TWO HAVING SMALL DEGREE DISTANCES

  • IOAN TOMESCU
    Faculty of Mathematics and Computer Science, University of Bucharest, Str. Academiei, 14, 010014 Bucharest, Romania
    ioan@fmi.unibuc.ro

Abstract

Topological indices, like degree distance, introduced by Dobrynin and Kochetova and Gutman were studied in mathematical chemistry. In this paper it is proved that in the class of connected graphs G of order n ≥ 4 and diameter equal to 2 such that G not ≅K<sub>1,n-1</sub>, the minimum degree distance is reached by K<sub>1,n-1</sub> + e and it is conjectured that the bistar consisting of vertex disjoint stars K<sub>1,n-3</sub> and K<sub>1,1</sub> with central vertices joined by an edge has minimum degree distance in the class of connected graphs G of order n such that G not ≅ K<sub>1,n-1</sub>.

Cuvinte cheie

Degree distance; Eccentricity; Diameter; Bistar.