Stability, domination, and irredundance in W_AR graphs

Publication date 17 December 2001

Published in Ars Combinatoria (Search for Journal in Brave)

clique partition dominating set independent set well-covered graph

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Review text

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.

Recommendations

Cited in

(1)

scientific article; zbMATH DE number 1409247 (Why is no real title available?)

This page was built for publication: Stability, domination, and irredundance in \(W_{AR}\) graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2761007)