On the graphs having at most one positive eccentricity eigenvalue

MaRDI QIDQ6356545zbMATH OpenFDO

Authors Sezer Sorgun, Hakan Küçük

Publication date 20 December 2020

Mathematics Subject Classification ID

Trees (05C05)

Abstract: The eccentricity (anti-adjacency) matrix $varepsilon(G)$ of a graph $G$ is obtained from the distance matrix by retaining the eccentricities in each row and each column. This matrix is first defined in 2018 by Wang et al. cite{1}. In this paper we have characterized the graphs which have at most one (hence exactly) positive eigenvalue of $varepsilon(G)$.

This page was built for publication: On the graphs having at most one positive eccentricity eigenvalue

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6356545)