Harmonic index

Vertices are labeled by their degree. The edges in the graph are labeled 2 divided by the sum of the degrees of vertices incident to it. The Harmonic index is the sum of these edge labels.

The harmonic index is a topological index based on the degrees of vertices in a graph. Introduced by Fajtlowicz in 1987, it has become an important descriptor in chemical graph theory and has been extensively studied for its mathematical properties and applications.

Definition

For a simple connected graph $G=(V,E)$ with vertex set $V$ and edge set $E$, the harmonic index $H(G)$ is defined as:

$H(G)=\sum _{uv\in E(G)}\frac{2}{d(u)+d(v)}$

where $d(u)$ and $d(v)$ denote the degrees of vertices $u$ and $v$ respectively, and the sum is taken over all edges $uv$ in $G$.

Relationship to other indices

The harmonic index is closely related to the Randić index and can be considered as one of its variants. While the Randić index uses $(d(u)\cdot d(v){)}^{-1/2}$ as the edge weight, the harmonic index uses the harmonic mean of the endpoint degrees.

The harmonic index is also related to the inverse degree of a graph:

$ID(G)=\sum _{u\in V(G)}\frac{1}{d(u)}$

Properties

Bounds

For a connected graph $G$ with $n$ vertices, $m$ edges, maximum degree $\mathrm{\Delta }$, minimum degree $\delta$, and $p$ pendant edges:

Lower bound:

$H(G)\ge \frac{2p}{\mathrm{\Delta }+1}+\frac{m-p}{\mathrm{\Delta }}$

Equality holds if and only if $G$ is the star graph $K_{1,n-1}$, a regular graph, or a $(\mathrm{\Delta },1)$-semiregular graph.

Upper bounds: Various upper bounds have been established for specific graph classes. For example, for trees:

• For any tree $T$ of order $n\ge 3$: $H(T)\le H(P_n)=\frac{n-3}{4}+\frac{4}{3}$, with equality if and only if $T$ is the path graph $P_n$
• For any tree $T$ of order $n\ge 3$: $H(T)\ge H(S_n)=\frac{2(n-1)}{n}$, with equality if and only if $T$ is the star graph $S_n$

Extremal graphs

Among all connected graphs with $n$ vertices:

• The complete graph $K_n$ maximizes the harmonic index
• The path graph $P_n$ maximizes the harmonic index among trees
• The star graph $S_n$ has the minimum harmonic index among trees

For unicyclic graphs of order $n$:

• The cycle $C_n$ achieves the maximum value: $H(C_n)=n/2$
• The graph $S(n-2,1,1)$ achieves the minimum value

Harmonic polynomial

The harmonic polynomial of a graph $G$ is defined as:

$H(G,x)=\sum _{uv\in E(G)}{x}^{d(u)+d(v)-1}$

This polynomial is named for its relationship to the harmonic index:

$H(G)=2{\int }_0^{1}H(G,x)dx$

The harmonic polynomial is also related to the first Zagreb polynomial

$M_1(G,x)=\sum _{uv\in E}{x}^{d(u)+d(v)}$

by the equality:

$M_1(G,x)=x\cdot H(G,x)$.

Values for specific graphs

For several common graph families, the harmonic index has closed-form expressions:

• Complete graph $K_n$: $H(K_n)=\frac{n}{2}$
• Cycle graph $C_n$: $H(C_n)=\frac{n}{2}$
• Path graph $P_n$: $H(P_n)=\frac{n-3}{4}+\frac{4}{3}$ for $n\ge 3$
• Star graph $S_n$: $H(S_n)=\frac{2(n-1)}{n}$
• Complete bipartite graph $K_{n_1,n_2}$: $H(K_{n_1,n_2})=\frac{2n_1{n}_2}{n_1+n_2}$
• Hypercube graph $Q_n$: $H(Q_n)=2^{n-1}$

Hamiltonian properties

Recent work has established connections between the harmonic index and Hamiltonian properties of graphs:

Theorem (Li, 2024): Let $G$ be a $k$-connected graph with $n$ vertices and $e$ edges, where $k\ge 2$ and $n\ge 3$. If

$H(G)\ge \frac{(\delta +\mathrm{\Delta }{)}^2}{2M\delta \mathrm{\Delta }}\cdot e^2$

where $M=(k+1){\delta }^2+\frac{e^2}{n-(k+1)}$, then $G$ is Hamiltonian.

A similar result holds for traceable graphs with $k\ge 1$ and $n\ge 9$.

Operations on graphs

The harmonic index has been studied extensively for various graph operations:

Cartesian product

For graphs $G_1$ and $G_2$, the harmonic index of their Cartesian product satisfies:

$H(G_1\times G_2)\ge \frac{1}{2}H(G_1)ID(G_2)+\frac{1}{2}H(G_2)ID(G_1)$

Other products

Similar results have been established for:

• Corona product
• Join of graphs
• Cartesian sum
• Lexicographic product

Graph perturbations

The harmonic index exhibits predictable behavior under certain graph operations:

• Edge separation: If $e=uv$ is a cut edge with both components having at least two vertices, contracting $e$ and adding a pendant edge decreases the harmonic index.
• Edge grafting: Moving pendant paths to concentrate at a single vertex generally increases the harmonic index.
• Vertex deletion: Removing a pendant vertex strictly decreases the harmonic index: $H(G)>H(G-v)$ for any pendant vertex $v$.

Applications

The harmonic index has found applications in chemical graph theory, where it serves as a molecular descriptor for predicting physicochemical properties of chemical compounds. In QSAR/QSPR studies (quantitative structure-activity and structure-property relationships), the harmonic index has proven useful for correlating molecular structure with biological activity and physical properties.

The harmonic index has also been applied to network analysis, where it helps measure connectivity and structural properties of various types of networks. Its mathematical properties, particularly its relationship to vertex degrees and its behavior under graph operations, make it a useful tool for understanding graph structure in both theoretical and applied contexts.

Computational complexity

The harmonic index can be computed in $O(m)$ time for a graph with $m$ edges, since it requires only a single pass through all edges. An $O(n^2)$ algorithm for computing the harmonic polynomial has been developed.

See also

• Randić index
• Zagreb indices
• Topological index
• Chemical graph theory
• Wiener index