Equistable series-parallel graphs

Authors:
Ephraim Korach;Uri N. Peled
Affiliations:
Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, P.O. Box 653, Beer-Sheva 84105, Israel;Mathematics, Statistics, and Computer Science Department (M/C 249), The University of Illinois at Chicago, 851 S. Morgan Street, Chicago, IL
Venue:
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
Year:
2003

Citing 2
Cited 5

Equistable graphs

Journal of Graph Theory
Equistable chordal graphs

Discrete Applied Mathematics - Special issue on stability in graphs and related topics

Equistable chordal graphs

Discrete Applied Mathematics - Special issue on stability in graphs and related topics
Equistable distance-hereditary graphs

Discrete Applied Mathematics
Equistable graphs, general partition graphs, triangle graphs, and graph products

Discrete Applied Mathematics
On the recognition of k-equistable graphs

WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Equistable simplicial, very well-covered, and line graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 outer-planar graphs.