Spectra of eccentricity matrix of a graph
This paper investigates the eccentricity matrix, \(\varepsilon(G)\), focusing on the \(H\)-join of graphs \(H[G_1, \dots, G_k]\). Building upon the explicit structure of the eccentricity matrix for the \(H\)-join, they construct a novel family of \(\varepsilon\)-cospectral graphs. They also derive the eccentricity spectrum for the lexicographic product \(H[G]\) provided the radius of \(H\) is at least three. Other results include the spectra for complete joins \(K_k[G_1, \dots, G_k]\) with bounded maximum degrees, as well as for \(H\)-joins where components with eccentricity two in \(H\) are complete graphs. At the end, the authors also establish the characteristic polynomial for the star-join \(K_{1,m}[G_0, \dots, G_m]\) consisting of regular graphs. These findings generalize several existing results concerning the eccentricity spectra of graph products.
This page was built for publication: Spectra of eccentricity matrix of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6872177)
