Abstract: A circulant is a Cayley graph over a cyclic group. A well-covered graph is a graph in which all maximal stable sets are of the same size, or in other words, they are all maximum. A CIS graph is a graph in which every maximal stable set and every maximal clique intersect. It is not difficult to show that a circulant G is a CIS graph if and only if G and its complement are both well-covered and the product of the independence and the clique numbers of G is equal to the number of vertices. It is also easy to demonstrate that both families, the circulants and the CIS graphs, are closed with respect to the operations of taking the complement and lexicographic product. We study the structure of the CIS circulants. It is well-known that all P_4-free graphs are CIS. In this paper, in addition to the simple family of the P_4-free circulants, we construct a non-trivial sparse but infinite family of CIS circulants. We are not aware of any CIS circulant that could not be obtained from graphs in this family by the operations of taking the complement and lexicographic product.
Recommendations
Cites work
- scientific article; zbMATH DE number 434906 (Why is no real title available?)
- scientific article; zbMATH DE number 3121699 (Why is no real title available?)
- scientific article; zbMATH DE number 4163144 (Why is no real title available?)
- scientific article; zbMATH DE number 3974977 (Why is no real title available?)
- scientific article; zbMATH DE number 3545568 (Why is no real title available?)
- scientific article; zbMATH DE number 1286503 (Why is no real title available?)
- scientific article; zbMATH DE number 702896 (Why is no real title available?)
- A characterization of almost CIS graphs
- A circular graph---counterexample to the Duchet kernel conjecture
- Blocking and anti-blocking pairs of polyhedra
- Combinatorial designs related to the strong perfect graph conjecture
- Complement reducible graphs
- Complexity results for well‐covered graphs
- Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs
- Grinstead's conjecture is true for graphs with a small clique number
- Handbook of product graphs
- Hardness results and spectral techniques for combinatorial problems on circulant graphs
- Independence polynomials of circulants with an application to music
- Normal hypergraphs and the perfect graph conjecture
- On circular critical graphs
- On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems
- On graphs whose maximal cliques and stable sets intersect
- On split and almost CIS-graphs
- PRODUCTS OF CIRCULANT GRAPHS
- Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs
- Some covering concepts in graphs
- The structure of well-covered graphs and the complexity of their recognition problems
- WELL-COVERED GRAPHS: A SURVEY
- Well-covered circulant graphs
- Ádám's conjecture is true in the square-free case
Cited in
(18)- On equistable, split, CIS, and related classes of graphs
- On graphs whose maximal cliques and stable sets intersect
- Detecting strong cliques
- Strong cliques in diamond-free graphs
- Strong cliques in vertex‐transitive graphs
- More on discrete convexity
- A characterization of claw-free CIS graphs and new results on the order of CIS graphs
- A large class of graphs with a small subclass of Cohen-Macaulay members
- Cohen-Macaulayness of two classes of circulant graphs
- Vertex-transitive CIS graphs
- scientific article; zbMATH DE number 7308162 (Why is no real title available?)
- Graphs vertex-partitionable into strong cliques
- Sandwich problem for \(\varPi\)- and \(\varDelta\)-free multigraphs and its applications to positional games
- Independence complexes of well-covered circulant graphs
- On Minkowski space and finite geometry
- Recognizing generating subgraphs in graphs without cycles of lengths 6 and 7
- Betti numbers of some circulant graphs
- A characterization of almost CIS graphs
This page was built for publication: On CIS circulants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q394314)
