A CHARACTERIZATION OF ALMOST CIS GRAPHS

被引：6
|
作者：
Wu, Yezhou [2 ]
Zang, Wenan [1 ]
Zhang, Cun-Quan [2 ]
机构：
[1] Univ Hong Kong, Dept Math, Pokfulam, Hong Kong, Peoples R China
[2] W Virginia Univ, Dept Math, Morgantown, WV 26506 USA
来源：
SIAM JOURNAL ON DISCRETE MATHEMATICS | 2009年 / 23卷 / 02期
关键词：
graph; clique; stable set; algorithm; MAXIMAL STABLE SETS; CLIQUES;
D O I：
10.1137/080723739
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A graph G is called CIS if each maximal clique intersects each maximal stable set in G and is called almost CIS if it has a unique disjoint pair (C, S) consisting of a maximal clique C and a maximal stable set S. While it is still unknown if there exists a good structural characterization of all CIS graphs, in this note we prove the following Andrade-Boros-Gurvich conjecture: A graph is almost CIS if and only if it is a split graph with a unique split partition.
引用
收藏
页码：749 / 753
页数：5
相关论文
共 50 条
  • [1] On split and almost CIS-graphs
    Boros, Endre
    Gurvich, Vladimir
    Zverovich, Igor
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2009, 43 : 163 - 180
  • [2] A Characterization of Claw-free CIS Graphs and New Results on the Order of CIS Graphs
    Alcon, Liliana
    Gutierrez, Marisa
    Milanic, Martin
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2019, 346 : 15 - 27
  • [3] On Almost Self-centered Graphs and Almost Peripheral Graphs
    Hu, Yanan
    Zhan, Xingzhi
    TAIWANESE JOURNAL OF MATHEMATICS, 2022, : 887 - 901
  • [4] Almost universal graphs
    Frieze, Alan
    Krivelevich, Michael
    RANDOM STRUCTURES & ALGORITHMS, 2006, 28 (04) : 499 - 510
  • [5] On almost hypohamiltonian graphs
    Goedgebeur, Jan
    Zamfirescu, Carol T.
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2019, 21 (04):
  • [6] A Characterization of Edge-Ordered Graphs with Almost Linear Extremal Functions
    Gaurav Kucheriya
    Gábor Tardos
    Combinatorica, 2023, 43 : 1111 - 1123
  • [7] A Characterization of Edge-Ordered Graphs with Almost Linear Extremal Functions
    Kucheriya, Gaurav
    Tardos, Gabor
    COMBINATORICA, 2023, 43 (06) : 1111 - 1123
  • [8] DELAUNAY GRAPHS ARE ALMOST AS GOOD AS COMPLETE GRAPHS
    DOBKIN, DP
    FRIEDMAN, SJ
    SUPOWIT, KJ
    DISCRETE & COMPUTATIONAL GEOMETRY, 1990, 5 (04) : 399 - 407
  • [9] Almost surely almost exact optimization in random graphs
    Faragó, A
    FCS '05: Proceedings of the 2005 International Conference on Foundations of Computer Science, 2005, : 94 - 100
  • [10] A NOTE ON ALMOST REGULAR GRAPHS
    HOFMEISTER, M
    MATHEMATISCHE NACHRICHTEN, 1994, 166 : 259 - 262
12345