On the eccentricity matrix of graphs and its applications to the boiling point of hydrocarbons
J Wang, X Lei, W Wei, X Luo, S Li - Chemometrics and Intelligent …, 2020 - Elsevier
The eccentricity matrix E (G) of a graph G is derived from the distance matrix by keeping for
each row and each column only the largest distances and leaving zeros in the remaining …
each row and each column only the largest distances and leaving zeros in the remaining …
On the eccentricity matrices of trees: Inertia and spectral symmetry
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 …
G by keeping the largest nonzero entries in each row and each column, and leaving zeros in …
Characterizing the extremal graphs with respect to the eccentricity spectral radius, and beyond
W Wei, S Li, L Zhang - Discrete Mathematics, 2022 - Elsevier
The eccentricity matrix E (G) of a graph G is derived from the corresponding distance matrix
by keeping only the largest non-zero elements for each row and each column and leaving …
by keeping only the largest non-zero elements for each row and each column and leaving …
On the eigenvalues of eccentricity matrix of graphs
X Lei, J Wang, G Li - Discrete Applied Mathematics, 2021 - Elsevier
The eccentricity matrix E (G)(Randić, 2013; Wang et al., 2018) is derived from the distance
matrix by keeping for each row and each column only the largest distances and leaving …
matrix by keeping for each row and each column only the largest distances and leaving …
The eccentricity matrix of a digraph
X Yang, L Wang - Discrete Applied Mathematics, 2022 - Elsevier
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 …
largest distances in each row and each column, and leaving 0 in the remaining ones …
On the eccentricity spectra of complete multipartite graphs
W Wei, S Li - Applied Mathematics and Computation, 2022 - Elsevier
The eccentricity matrix E (G) of a graph G is derived from the corresponding distance matrix
by keeping only the largest non-zero elements for each row and each column and leaving …
by keeping only the largest non-zero elements for each row and each column and leaving …
Spectral determination of graphs with one positive anti-adjacency eigenvalue
X Lei, J Wang - Applied Mathematics and Computation, 2022 - Elsevier
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 …
matrix by retaining for each row and each column only the largest distances. This matrix can …
Spectral spread and trace norm of eccentricity matrix of graphs
BA Rather, X Gao, J Wang - Discrete Applied Mathematics, 2024 - Elsevier
The spectral spread of the eccentricity matrix E (G) of a graph G is defined as the difference
between the largest and the smallest eigenvalue of E (G). While the trace norm of the …
between the largest and the smallest eigenvalue of E (G). While the trace norm of the …
Eccentricity energy change of complete multipartite graphs due to edge deletion
The eccentricity matrix ɛ (G) of a graph G is obtained from the distance matrix of G by
retaining the largest distances in each row and each column, and leaving zeros in the …
retaining the largest distances in each row and each column, and leaving zeros in the …
On two problems related to anti-adjacency (eccentricity) matrix
S Sorgun, H Küçük - Discrete Applied Mathematics, 2023 - Elsevier
The anti-adjacency (aka eccentricity) matrix A (G) of a graph G is obtained from the distance
matrix by retaining the eccentricities (the largest distance) in each row and each column …
matrix by retaining the eccentricities (the largest distance) in each row and each column …