A graph is called equistable when there is a non-negative weight function on its vertices such that a set S of vertices has total weight 1 if and only if S is maximal stable. We show that a chordal graph is equistable if and only if every two adjacent non-simplicial vertices have a common simplicial
Equistable graphs
β Scribed by N. V. R. Mahadev; Uri N. Peled; Feng Sun
- Publisher
- John Wiley and Sons
- Year
- 1994
- Tongue
- English
- Weight
- 821 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
An equistable graph is a graph for which the incidence vectors of the maximal stable sets are the 0β1 solutions of a linear equation. A necessary condition and a sufficient condition for equistability are given. They are used to characterize the equistability of various classes of perfect graphs, outerplanar graphs, and pseudothreshold graphs. Some classes of equistable graphs are shown to be closed under graph substitution.
π SIMILAR VOLUMES
A graph is called equistable when there is a non-negative weight function on its vertices such that a set S of vertices has total weight 1 if and only if S is maximal stable. We characterize those series-parallel graphs that are equistable, generalizing results of Mahadev et al. about equistable out
A thwahold grerph (rtzspativ4y domlshukf graph) is 01 graph for which the independent 881% (rapsctiwzly ths dominuting a&a) cctn bgr chnfuctsrixsd by the 0, l-aolutiona of a linaur ## kpallty (ass [ij and [S]), We define here the #rugher far which the mawlmal indapsndent eettr (rsopsctivsly tha m