l-Connectivity, Integrity, Tenacity, Toughness and Eigenvalues of Graphs

被引：0
作者：
Chen, Hongzhang [1 ]
Li, Jianxi [1 ]
机构：
[1] Minnan Normal Univ, Sch Math & Stat, Zhangzhou 363000, Peoples R China
来源：
BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY | 2022年 / 45卷 / 06期
关键词：
Eigenvalues; l-connectivity; Integrity; Tenacity; Toughness; SPECTRUM;
D O I：
10.1007/s40840-022-01381-2
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Using the eigenvalues of a graph to reflect its structural properties is a central topic in spectral graph theory. Especially, the relationships between the eigenvalues of a graph and its structural parameters have been studied extensively. In this paper, we explore the relationships between the (normalized) Laplacian eigenvalues of a graph and its t-connectivity, integrity, tenacity and toughness. Some of our results extend or improve the related existing results.
引用
收藏
页码：3307 / 3320
页数：14
相关论文
共 23 条
  • [1] TOUGH RAMSEY GRAPHS WITHOUT SHORT CYCLES
    ALON, N
    [J]. JOURNAL OF ALGEBRAIC COMBINATORICS, 1995, 4 (03) : 189 - 195
  • [2] Atici M., 2001, J COMBIN MATH COMBIN, V37, P27
  • [3] BAREFOOT C A, 1987, J. Combin. Math. Combin. Computing, V1, P13
  • [4] Toughness in graphs - A survey
    Bauer, D
    Broersma, H
    Schmeichel, E
    [J]. GRAPHS AND COMBINATORICS, 2006, 22 (01) : 1 - 35
  • [5] Bondy JA., 1976, GRAPH THEORY APPL, DOI [10.1007/978-1-349-03521-2, DOI 10.1007/978-1-349-03521-2]
  • [6] BROUWER AE, 1995, LINEAR ALGEBRA APPL, V226, P267, DOI 10.1016/0024-3795(95)00154-J
  • [7] Chung F.R., 1997, Spectral graph theory, DOI DOI 10.1090/CBMS/092
  • [8] Chung F.R.K., 2004, SURVEYS DIFFERENTIAL, VIX, P53, DOI DOI 10.4310/SDG.2004.v9.n1.a3
  • [9] Chvatal V., 1973, Discrete Mathematics, V5, P215, DOI 10.1016/0012-365X(73)90138-6
  • [10] Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs
    Cioab, Sebastian M.
    Gu, Xiaofeng
    [J]. CZECHOSLOVAK MATHEMATICAL JOURNAL, 2016, 66 (03) : 913 - 924
123