Equistable chordal graphs

Authors:
Uri N. Peled;Udi Rotics
Affiliations:
Mathematics, Statistics, and Computer Science Department (Mail code 249), The University of Illinois at Chicago, 851 South Morgan Street, Chicago, IL;School of Mathematics and Computer Science, Netanya Academic College, Netanya 42365, Israel
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 series-parallel graphs

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

Equistable series-parallel 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 show that a chordal graph is equistable if and only if every two adjacent non-simplicial vertices have a common simplicial neighbor.