#### Filter Results:

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

A stable (or independent) set is a set of vertices where no two of the vertices in the set are adjacent. The stability polynomial A(G; p) of a graph G is the probability that a set of randomly chosen vertices is stable where the probability of each vertex being chosen is p, with choices independent. This polynomial is analogous to the chromatic polynomial… (More)

- ‹
- 1
- ›