T. Haritha

collaborators

3 papers

math.CO2025

On the resistance regular graphs

Haritha T, Chithra A

For a connected graph $G$ , its resistance distance matrix is denoted by $R (G)$ . A graph is called resistance regular if all the row (or column) sums of $R (G)$ are equal. We provide…

math.CO2025

On the distance spectral gap and construction of D-equienergetic graphs

Haritha T, Chithra A.

Let $D (G)$ denote the distance matrix of a connected graph $G$ with $n$ vertices. The distance spectral gap of a graph $G$ is defined as $I^´_{D^{G}} = I ¨ _{1} - I ¨ _{2}$ , where $I ¨ _{1}$ and…

math.CO2024

Resistance distance and Kirchhoff index in central vertex join and central edge join of two graphs

Haritha T, Chithra A

The central graph $C (G)$ of a graph $G$ is the graph obtained by inserting a new vertex into each edge of $G$ exactly once and joining all the non-adjacent vertices in $G$ . Let $G_…