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 条
  • [1] Clique number and distance spectral radii of graphs
    Zhai, Mingqing
    Yu, Guanglong
    Shu, Jinlong
    ARS COMBINATORIA, 2012, 104 : 385 - 392
  • [2] ON THE SPECTRAL MOMENT OF GRAPHS WITH GIVEN CLIQUE NUMBER
    Li, Shuchao
    Hu, Shuna
    ROCKY MOUNTAIN JOURNAL OF MATHEMATICS, 2016, 46 (01) : 261 - 282
  • [3] New Bounds on the Clique Number of Graphs Based on Spectral Hypergraph Theory
    Bulo, Samuel Rota
    Pelillo, Marcell
    LEARNING AND INTELLIGENT OPTIMIZATION, 2009, 5851 : 45 - 58
  • [4] Spectral extrema of graphs with bounded clique number and matching number
    Wang, Hongyu
    Hou, Xinmin
    Ma, Yue
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2023, 669 : 125 - 135
  • [5] A simpler characterization of a spectral lower bound on the clique number
    Yildirim, E. Alper
    MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2010, 71 (02) : 267 - 281
  • [6] The Smallest Spectral Radius of Graphs with a Given Clique Number
    Zhang, Jing-Ming
    Huang, Ting-Zhu
    Guo, Ji-Ming
    SCIENTIFIC WORLD JOURNAL, 2014,
  • [7] A simpler characterization of a spectral lower bound on the clique number
    E. Alper Yıldırım
    Mathematical Methods of Operations Research, 2010, 71 : 267 - 281
  • [8] A simpler characterization of a spectral lower bound on the clique number
    Yildirim, E. Alper
    Mathematical Methods of Operations Research, 2010, 71 (02): : 267 - 281
  • [9] The smallest Laplacian spectral radius of graphs with a given clique number
    Guo, Ji-Ming
    Li, Jianxi
    Shiu, Wai Chee
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2012, 437 (04) : 1109 - 1122
  • [10] Quotient of spectral radius, (signless) Laplacian spectral radius and clique number of graphs
    Das, Kinkar Ch.
    Liu, Muhuo
    CZECHOSLOVAK MATHEMATICAL JOURNAL, 2016, 66 (03) : 1039 - 1048
12345