Energy internet (EI) has developed from concept and theoretical framework to practical
operation, attracting more and more attention. The application of complex network analysis …

The eccentricity matrix E (G) of a connected graph 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 anti-adjacency matrix (or eccentricity matrix) of a graph is obtained from its distance
matrix by retaining for each row and each column only the largest distances. This matrix can …

The eccentricity matrix of a digraph is obtained from the distance matrix by keeping the
largest distances in each row and each column, and leaving 0 in the remaining ones …

The eccentricity matrix ε (G) of a graph G is constructed from the distance matrix of G by
keeping only the largest distances for each row and each column. This matrix can be …

The eccentricity matrix of a graph is obtained from the distance matrix by keeping the entries
that are largest in their row or column, and replacing the remaining entries by zero. This …

The ϵ-spectral radius of a connected graph is the largest eigenvalue of its eccentricity
matrix. In this paper, we identify the unique n-vertex tree with diameter 4 and matching …

The eccentricity matrix of a connected graph G, denoted by E (G), is constructed from the
distance matrix of G by keeping only the largest nonzero elements in each row and each …

The eccentricity matrix of a simple connected graph is obtained from the distance matrix by
keeping only the entries that are largest in at least one of their row or column. This matrix …

The eccentricity matrix $\mathcal E (G) $ of a connected graph $ G $ is obtained from the
distance matrix of $ G $ by leaving unchanged the largest nonzero entries in each row and …