A New Spectral Bound on the Clique Number of Graphs

被引：0
|
作者：
Bulo, Samuel Rota [1 ]
Pelillo, Marcello [1 ]
机构：
[1] Univ Venice, Dipartimento Informat, I-30123 Venice, Italy
来源：
STRUCTURAL, SYNTACTIC, AND STATISTICAL PATTERN RECOGNITION | 2010年 / 6218卷
关键词：
MAXIMAL CLIQUES; ISOMORPHISM; RECOGNITION; ORDER;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Many computer vision and patter recognition problems are intimately related to the maximum clique problem. Due to the intractability of this problem, besides the development of heuristics, a research direction consists in trying to find good bounds on the clique number of graphs. This paper introduces a new spectral upper bound on the clique number of graphs, which is obtained by exploiting an invariance of a continuous characterization of the clique number of graphs introduced by Motzkin and Straus. Experimental results on random graphs show the superiority of our bounds over the standard literature.
引用
收藏
页码：680 / 689
页数：10
相关论文
共 50 条
  • [41] Relative Clique Number of Planar Signed Graphs
    Das, Sandip
    Ghosh, Prantar
    Mj, Swathyprabhu
    Sen, Sagnik
    ALGORITHMS AND DISCRETE APPLIED MATHEMATICS, CALDAM 2016, 2016, 9602 : 326 - 336
  • [42] SPECTRAL BOUNDS FOR THE CLIQUE AND INDEPENDENCE NUMBERS OF GRAPHS
    WILF, HS
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1986, 40 (01) : 113 - 117
  • [43] The jump of the clique chromatic number of random graphs
    Lichev, Lyuben
    Mitsche, Dieter
    Warnke, Lutz
    RANDOM STRUCTURES & ALGORITHMS, 2023, 62 (04) : 1016 - 1034
  • [44] On the clique-transversal number of chordal graphs
    Andreae, T
    DISCRETE MATHEMATICS, 1998, 191 (1-3) : 3 - 11
  • [45] The Zagreb indices of graphs with a given clique number
    Xu, Kexiang
    APPLIED MATHEMATICS LETTERS, 2011, 24 (06) : 1026 - 1030
  • [46] Clique number of Xor products of Kneser graphs
    Imolay, Andras
    Kocsis, Anett
    Schweitzer, Adam
    DISCRETE MATHEMATICS, 2022, 345 (07)
  • [47] THE CLIQUE MINOR OF GRAPHS WITH INDEPENDENCE NUMBER TWO
    Pang, Shiyou
    Miao, Lianying
    Sun, Qingbo
    Miao, Zhengke
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2009, 1 (01) : 121 - 125
  • [48] ON THE RAMSEY NUMBER OF TREES VERSUS GRAPHS WITH LARGE CLIQUE NUMBER
    GOULD, RJ
    JACOBSON, MS
    JOURNAL OF GRAPH THEORY, 1983, 7 (01) : 71 - 78
  • [49] Hardness of computing clique number and chromatic number for Cayley graphs
    Godsil, Chris
    Rooney, Brendan
    EUROPEAN JOURNAL OF COMBINATORICS, 2017, 62 : 147 - 166
  • [50] THE SHARP LOWER BOUND FOR THE SPECTRAL RADIUS OF CONNECTED GRAPHS WITH THE INDEPENDENCE NUMBER
    Jin, Ya-Lei
    Zhang, Xiao-Dong
    TAIWANESE JOURNAL OF MATHEMATICS, 2015, 19 (02): : 419 - 431
12345