EBSCO Logo
Connecting you to content on EBSCOhost
Title

THE SMALLEST HARMONIC INDEX OF TREES WITH GIVEN MAXIMUM DEGREE.

Authors

RASI, REZA; SHEIKHOLESLAMI, SEYED MAHMOUD

Abstract

The harmonic index of a graph G, denoted by H(G), is defined as the sum of weights 2/\d(u) d(v)] over all edges uv of G, where d(u) denotes the degree of a vertex u. In this paper we establish a lower bound on the harmonic index of a tree T.

Subjects

TREE graphs; GEOMETRIC vertices; MATHEMATICAL bounds; GRAPH connectivity; PATHS & cycles in graph theory

Publication

Discussiones Mathematicae: Graph Theory, 2018, Vol 38, Issue 2, p499

ISSN

1234-3099

Publication type

Academic Journal

DOI

10.7151/dmgt.2019

EBSCO Connect | Privacy policy | Terms of use | Copyright | Manage my cookies
Journals | Subjects | Sitemap
© 2025 EBSCO Industries, Inc. All rights reserved