Abstract
An equistable series-parallel graphs were characterized. A graph was called equistable when there was a non-negative weight function in its vertices such that a set S of vertices has total weight 1 if and only if S was maximal stable. The results of Mahadev et al. about equistable outer-planer graphs were also discussed.
| Original language | English |
|---|---|
| Pages (from-to) | 149-162 |
| Number of pages | 14 |
| Journal | Discrete Applied Mathematics |
| Volume | 132 |
| Issue number | 1-3 |
| DOIs | |
| State | Published - 15 Oct 2003 |
| Event | Stability in Graphs and Related Topics - Lausanne, Switzerland Duration: 1 Jul 2002 → 1 Jul 2002 |
Keywords
- Equistable graphs
- Series-parallel graphs
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Applied Mathematics