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.
机构:
Minnan Normal Univ, Sch Math & Stat, Zhangzhou 363000, Fujian, Peoples R ChinaMinnan Normal Univ, Sch Math & Stat, Zhangzhou 363000, Fujian, Peoples R China
Wu, Xiaoxia
Qian, Jianguo
论文数: 0引用数: 0
h-index: 0
机构:
Qinghai Minzu Univ, Sch Math & Stat, Xining 810007, Qinghai, Peoples R China
Xiamen Univ, Sch Math Sci, Xiamen 361005, Fujian, Peoples R ChinaMinnan Normal Univ, Sch Math & Stat, Zhangzhou 363000, Fujian, Peoples R China
Qian, Jianguo
Peng, Haigen
论文数: 0引用数: 0
h-index: 0
机构:
Minnan Normal Univ, Sch Math & Stat, Zhangzhou 363000, Fujian, Peoples R ChinaMinnan Normal Univ, Sch Math & Stat, Zhangzhou 363000, Fujian, Peoples R China
机构:
Department of Mathematics, East China University of Science and TechnologyDepartment of Mathematics, East China University of Science and Technology