Let G(n) ([-1](i)) denote the set of all connected graphs on n vertices having distance eigenvalue -1 of multiplicity i . By using the distribution of the third largest distance eigenvalue and the second least distance eigenvalue of a connected graph, in this paper we completely characterize the graphs in G(n) ([-1](i)), where i= n - 1 , n - 2 , n - 3 or n - 4 .
机构:
Univ Ljubljana, Fac Comp & Informat Sci, Ljubljana 1000, Slovenia
Univ Ljubljana, IMFM, Ljubljana 1000, SloveniaUniv Ghent, Dept Appl Math & Comp Sci, B-9000 Ghent, Belgium
Jurisic, Aleksandar
Koolen, Jack
论文数: 0引用数: 0
h-index: 0
机构:
POSTECH, Dept Math, Pohang, South KoreaUniv Ghent, Dept Appl Math & Comp Sci, B-9000 Ghent, Belgium
机构:
E China Normal Univ, Dept Math, Shanghai 200241, Peoples R ChinaE China Normal Univ, Dept Math, Shanghai 200241, Peoples R China
Liu, Ruifang
Zhai, Mingqing
论文数: 0引用数: 0
h-index: 0
机构:
E China Normal Univ, Dept Math, Shanghai 200241, Peoples R China
Chuzhou Univ, Dept Math, Chuzhou 239012, Anhui, Peoples R ChinaE China Normal Univ, Dept Math, Shanghai 200241, Peoples R China
Zhai, Mingqing
Shu, Jinlong
论文数: 0引用数: 0
h-index: 0
机构:
E China Normal Univ, Dept Math, Shanghai 200241, Peoples R China
E China Normal Univ, Shanghai Key Lab Trustworthy Comp, Shanghai 200062, Peoples R ChinaE China Normal Univ, Dept Math, Shanghai 200241, Peoples R China