Equistable distance-hereditary graphs

Ephraim Korach, Uri N. Peled, Udi Rotics

Research output: Contribution to journalArticlepeer-review

12 Scopus citations

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 show that a necessary condition for a graph to be equistable is sufficient when the graph in question is distance-hereditary. This is used to design a polynomial-time recognition algorithm for equistable distance-hereditary graphs.

Original languageEnglish
Pages (from-to)462-477
Number of pages16
JournalDiscrete Applied Mathematics
Volume156
Issue number4
DOIs
StatePublished - 15 Feb 2008

Keywords

  • Distance-hereditary graphs
  • Equistable graphs

Fingerprint

Dive into the research topics of 'Equistable distance-hereditary graphs'. Together they form a unique fingerprint.

Cite this