摘要
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 matrix can be interpreted as an opposite to the adjacency matrix,which is on the contrary obtained from the distance matrix by keeping only the entries equal to 1.In the paper,we determine graphs having the second largest eigenvalue of eccentricity matrix less than 1.
基金
supported by the Special Fund for Taishan Scholars Project
the IC Program of Shandong Institutions of Higher Learning For Youth Innovative Talents
supported by the National Natural Science Foundation of China (Grant No. 12371353)
supported by the Science Fund of the Republic of Serbia grant number 7749676:Spectrally Constrained Signed Graphs with Applications in Coding Theory and Control Theory–SCSG-ctct
