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
关键词
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 条
  • [31] ALMOST RECONSTRUCTING INFINITE, RAYLESS GRAPHS
    SCHMIDT, R
    JOURNAL OF GRAPH THEORY, 1985, 9 (02) : 205 - 211
  • [32] On Construction of Almost-Ramanujan Graphs
    Sun, He
    Zhu, Hong
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PROCEEDINGS, 2009, 5573 : 197 - +
  • [33] ALMOST SPANNING UNIVERSALITY IN RANDOM GRAPHS
    Parczyk, O.
    ACTA MATHEMATICA UNIVERSITATIS COMENIANAE, 2019, 88 (03): : 997 - 1002
  • [34] On the Critical Difference of Almost Bipartite Graphs
    Levit, Vadim E.
    Mandrescu, Eugen
    arXiv, 2019,
  • [35] Almost monotone contractions on weighted graphs
    Alfuraidan, Monther R.
    Bachar, Mostafa
    Khamsi, Mohamed A.
    JOURNAL OF NONLINEAR SCIENCES AND APPLICATIONS, 2016, 9 (08): : 5189 - 5195
  • [36] On the critical difference of almost bipartite graphs
    Levit, Vadim E.
    Mandrescu, Eugen
    JOURNAL OF ALGEBRAIC COMBINATORICS, 2022, 56 (01) : 59 - 73
  • [37] On almost distance-transitive graphs
    Guo, Wenbin
    Makhnev, A. A.
    Paduchikh, D. V.
    DOKLADY MATHEMATICS, 2013, 88 (02) : 581 - 585
  • [38] Almost all regular graphs are normal
    Rezaei, Seyed Saeed Changiz
    Hosseini, Seyyed Aliasghar
    Mohar, Bojan
    DISCRETE APPLIED MATHEMATICS, 2017, 230 : 51 - 55
  • [39] On almost distance-regular graphs
    Dalfo, C.
    van Dam, E. R.
    Fiol, M. A.
    Garriga, E.
    Gorissen, B. L.
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2011, 118 (03) : 1094 - 1113
  • [40] PROPERTIES OF ALMOST ALL GRAPHS AND COMPLEXES
    BLASS, A
    HARARY, F
    JOURNAL OF GRAPH THEORY, 1979, 3 (03) : 225 - 240