Processing math: 100%
World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

On the computation of extremal trees of Harmonic index with given edge-vertex domination number

    https://doi.org/10.1142/S0219691323500145Cited by:1 (Source: Crossref)

    Let v1,v2 be vertices of a graph G with degree of the vertices being d(v1) and d(v2), respectively. First, let us define the weight of the edge v1v2 as twice the value of 1d(v1)+d(v2) in G. Let us define H(G), the harmonic index of the graph G, as the sum obtained by adding the weight assigned to every edge of G. In this paper, for the class of trees, we shall obtain an upper bound for the harmonic index H(G) in terms of the edge-vertex domination number and the order of G. Also, we shall ascertain that the equality is true by characterizing the collection of all extremal trees attaining this bound.

    AMSC: 05C07, 05C35, 05C92