Paper detail

Extremal problems for the eccentricity matrices of complements of trees

The eccentricity matrix of a connected graph $G$, denoted by $\mathcal{E}(G)$, is obtained from the distance matrix of $G$ by keeping the largest nonzero entries in each row and each column, and leaving zeros in the remaining ones. The $\mathcal{E}$-eigenvalues of $G$ are the eigenvalues of $\mathcal{E}(G)$, in which the largest one is the $\mathcal{E}$-spectral radius of $G$. The $\mathcal{E}$-energy of $G$ is the sum of the absolute values of all $\mathcal{E}$-eigenvalues of $G$. In this article, we study some of the extremal problems for eccentricity matrices of complements of trees and characterize the extremal graphs. First, we determine the unique tree whose complement has minimum (respectively, maximum) $\mathcal{E}$-spectral radius among the complements of trees. Then, we prove that the $\mathcal{E}$-eigenvalues of the complement of a tree are symmetric about the origin. As a consequence of these results, we characterize the trees whose complement has minimum (respectively, maximum) least $\mathcal{E}$-eigenvalues among the complements of trees. Finally, we discuss the extremal problems for the second largest $\mathcal{E}$-eigenvalue and the $\mathcal{E}$-energy of complements of trees and characterize the extremal graphs. As an application, we obtain a Nordhaus-Gaddum type lower bounds for the second largest $\mathcal{E}$-eigenvalue and $\mathcal{E}$-energy of a tree and its complement.