Filomat · 2013 · 54 citations · 10 references
Natural SciencesMathematicsAlgorithmsCombinatoricsGeometryGraph AlgorithmsGraph TheoryHarmonic AnalysisExtremal IndexLower Bound Computation
The harmonic index H(G) of a graph G is defined as the sum of the weights of all edges uv of G, where d(u) denotes the degree of a vertex u in G. We give a best possible lower bound for the harmonic index of a graph (a triangle-free graph, respectively) with minimum degree at least two and characterize the extremal graphs.
10
Lingping Zhong · Applied Mathematics Letters · 2011 · 298 citations
Siemion Fajtlowicz · Discrete Mathematics · 1988 · 290 citations
Variable neighborhood search for extremal graphs
Gilles Caporossi, İvan Gutman, Pierre Hansen · Computers & Chemistry · 1999 · 246 citations