A graph for which the inertia bound is not tight

被引：0
|
作者：
John Sinkovic
机构：
[1] University of Waterloo,Department of Combinatorics and Optimization
来源：
Journal of Algebraic Combinatorics | 2018年 / 47卷
关键词：
Inertia bound; Cvetković bound; Independence number; Weight matrix; 05C50; 05C69; 15A42;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The inertia bound gives an upper bound on the independence number of a graph by considering the inertia of matrices corresponding to the graph. The bound is known to be tight for graphs on 10 or fewer vertices as well as for all perfect graphs. It is natural to question whether the bound is always tight. We show that the bound is not tight for the Paley graph on 17 vertices as well as its induced subgraph on 16 vertices.
引用
收藏
页码：39 / 50
页数：11
相关论文
共 50 条
  • [1] A graph for which the inertia bound is not tight
    Sinkovic, John
    [J]. JOURNAL OF ALGEBRAIC COMBINATORICS, 2018, 47 (01) : 39 - 50
  • [2] The inertia bound is far from tight
    Kwan, Matthew
    Wigderson, Yuval
    [J]. BULLETIN OF THE LONDON MATHEMATICAL SOCIETY, 2024,
  • [3] Tight Lower Bound for Percolation Threshold on an Infinite Graph
    Hamilton, Kathleen E.
    Pryadko, Leonid P.
    [J]. PHYSICAL REVIEW LETTERS, 2014, 113 (20)
  • [4] Tight lower bound on the maximum genus of a simplicial graph
    [J]. Discrete Math, 1-3 (83):
  • [5] A tight lower bound on the maximum genus of a simplicial graph
    Chen, J
    Kanchi, SP
    Gross, JL
    [J]. DISCRETE MATHEMATICS, 1996, 156 (1-3) : 83 - 102
  • [6] USING VARIANTS OF ZERO FORCING TO BOUND THE INERTIA SET OF A GRAPH
    Butler, Steve
    Grout, Jason
    Hall, H. Tracy
    [J]. ELECTRONIC JOURNAL OF LINEAR ALGEBRA, 2015, 30 : 1 - 18
  • [7] A tight upper bound on the average order of dominating sets of a graph
    Beaton, Iain
    Cameron, Ben
    [J]. JOURNAL OF GRAPH THEORY, 2024, : 463 - 477
  • [8] A bound on the Laplacian spread which is tight for strongly regular graphs
    Lin, Fan-Hsuan
    Weng, Chih-wen
    [J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 2015, 494 : 11 - 22
  • [9] On transformations of posets which have the same bound graph
    Era, H
    Ogawa, K
    Tsuchiya, M
    [J]. DISCRETE MATHEMATICS, 2001, 235 (1-3) : 215 - 220
  • [10] An Upper Bound Asymptotically Tight for the Connectivity of the Disjointness Graph of Segments in the Plane
    Espinoza-Valdez, Aurora
    Leanos, Jesus
    Ndjatchi, Christophe
    Rios-Castro, Luis Manuel
    [J]. SYMMETRY-BASEL, 2021, 13 (06):
12345