Greedoids on Vertex Sets of Unicycle Graphs

Details Greedoids on Vertex Sets of Unicycle Graphs Greedoids on Vertex Sets of Unicycle Graphs

2009-05-07

arxiv.org/abs/0905.1024v1

Mathematics

Combinatorics

9 pages; 4 figures

Scientific paper

A maximum stable set in a graph G is a stable set of maximum cardinality. S is a local maximum stable set of G, if S is a maximum stable set of the subgraph induced by its closed neighborhood. It is known that the family of all local maximum stable sets of a forest forms a greedoid on its vertex set. Bipartite, triangle-free, and well-covered graphs whose families of local maximum stable sets form greedoids have been analyzed as well. A unicycle graph owns only one cycle. In this paper we characterize the unicycle graphs whose families of local maximum stable sets form greedoids.

Affiliated with

Also associated with

No associations

Rating

Greedoids on Vertex Sets of Unicycle Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Greedoids on Vertex Sets of Unicycle Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Greedoids on Vertex Sets of Unicycle Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-455668