𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On uniform N-equistability

✍ Scribed by S Rolewicz

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
273 KB
Volume
115
Category
Article
ISSN
0022-247X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Equistable graphs
Equistable graphs
✍ N. V. R. Mahadev; Uri N. Peled; Feng Sun πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 821 KB

## 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 perfe

Equistable chordal graphs
Equistable chordal graphs
✍ Uri N. Peled; Udi Rotics πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 130 KB

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 series–parallel graphs
Equistable series–parallel graphs
✍ Ephraim Korach; Uri N. Peled πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 163 KB

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