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 条
12345