On Connected Graphs with Distance Eigenvalue -1 of Multiplicity at Least n-4

被引：0
|
作者：
Yang, Yuhong [1 ,2 ]
机构：
[1] Tianjin Univ Technol, Inst Signal Proc & Machine Learning, Coll Sci, Tianjin 300384, Peoples R China
[2] Xinjiang Univ, Coll Math & Syst Sci, Urumqi 830046, Peoples R China
来源：
ALGEBRA COLLOQUIUM | 2023年 / 30卷 / 04期
基金：
中国国家自然科学基金;
关键词：
distance hereditary graph; distance spectrum; canonical graph; primitive graph; 2; SINGULAR-VALUES; COMBINATORIAL DESIGNS; REGULAR GRAPHS; ENERGY; SPECTRA;
D O I：
10.1142/S1005386723000482
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
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 .
引用
收藏
页码：639 / 648
页数：10
相关论文
共 50 条
  • [41] GRAPHS WHOSE LEAST EIGENVALUE EXCEEDS-1-SQUARE-ROOT-2
    HOFFMAN, AJ
    LINEAR ALGEBRA AND ITS APPLICATIONS, 1977, 16 (02) : 153 - 165
  • [42] Connected (K4 - e)-free graphs whose second largest eigenvalue does not exceed 1
    Liu, Muhuo
    Chen, Chaohui
    Stanic, Zoran
    EUROPEAN JOURNAL OF COMBINATORICS, 2024, 115
  • [43] REMOVABLE CYCLES IN 2-CONNECTED GRAPHS OF MINIMUM DEGREE AT LEAST 4
    JACKSON, B
    JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 1980, 21 (JUN): : 385 - 392
  • [44] On graphs with at least three distance eigenvalues less than-1
    Lin, Huiqiu
    Zhai, Mingqing
    Gong, Shicai
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2014, 458 : 548 - 558
  • [45] Distance-regular graphs of diameter 3 having eigenvalue-1
    Bang, Sejeong
    Koolen, Jack
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2017, 531 : 38 - 53
  • [46] On graphs whose third largest distance eigenvalue dose not exceed-1
    Xue, Jie
    Liu, Ruifang
    Shu, Jinlong
    APPLIED MATHEMATICS AND COMPUTATION, 2021, 402
  • [47] CHROMATIC CLASSES OF 2-CONNECTED (N,N+3)-GRAPHS WITH AT LEAST 2 TRIANGLES
    KOH, KM
    TEO, KL
    DISCRETE MATHEMATICS, 1994, 127 (1-3) : 243 - 258
  • [48] ON 1-FACTORS OF N-CONNECTED GRAPHS
    ZAKS, JY
    NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1969, 16 (04): : 649 - &
  • [49] ON MINORS OF GRAPHS WITH AT LEAST 3N-4 EDGES
    KHALIFAT, M
    POLITOF, T
    SATYANARAYANA, A
    JOURNAL OF GRAPH THEORY, 1993, 17 (04) : 523 - 529
  • [50] VARIABLE AND FIXED RANK-1 N-4 INTERCONNECTIONS
    CAULFIELD, HJ
    1989 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-3: CONFERENCE PROCEEDINGS, 1989, : 405 - 407
12345