Stability, domination, and irredundance in \(W_{AR}\) graphs (Q2761007)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Stability, domination, and irredundance in \(W_{AR}\) graphs |
scientific article; zbMATH DE number 1682819
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Stability, domination, and irredundance in \(W_{AR}\) graphs |
scientific article; zbMATH DE number 1682819 |
Statements
17 December 2001
0 references
well-covered graph
0 references
clique partition
0 references
independent set
0 references
dominating set
0 references
Stability, domination, and irredundance in \(W_{AR}\) graphs (English)
0 references
A graph is well covered, if it has no isolated vertices and all the maximal independent sets in it have the same cardinality. A certain subclass of the class of well-covered graphs is the class of \(W_{AR}\) graphs introduced by R. S. Sankaranarayana. A graph \(G\) is a \(W_{AR}\) graph, if it has a clique partition \(C\) with a certain property \(Q\) (a \(Q\)-clique partition). Properties of \(W_{AR}\) graphs are studied. The headings of sections of the paper are: 1. Introduction, 2. Equivalence relation, 3. Reduction, 4. Independent, dominating and irredundant sets.
0 references
