On the eccentric graph of trees

arXiv2307.03835MaRDI QIDQ6443014FDOQ6443014

Authors: Sezer Sorgun, Esma Elyemani 

Publication date: 7 July 2023

Abstract: We consider the eccentric graph of a graph $G$, denoted by $ecc(G)$, which has the same vertex set as $G$, and two vertices in the eccentric graph are adjacent iff their distance in $G$ is equal to the eccentricity of one of them. In this paper, we present a fundamental requirement for the isomorphism between $ecc(G)$ and the complement of $G$, and show that the previous necessary condition given in the literature is inadequate. Also we obtain that diameter of $ecc(T)$ is at most $3$ for any tree and get some characterizations of the eccentric graph of trees.

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

This page was built for publication: On the eccentric graph of trees

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