Loading...
Please wait, while we are loading the content...
Similar Documents
Greedoids on vertex sets of unicycle graphs (2009).
| Content Provider | CiteSeerX |
|---|---|
| Author | Levit, Vadim E. Mandrescu, Eugen |
| Abstract | A maximum stable set in a graph G is a stable set of maximum size. S is a local maximum stable set of G, and we write S ∈ Ψ(G), if S is a maximum stable set of the subgraph spanned by S ∪ N(S), where N(S) is the neighborhood of S. G is a unicycle graph if it owns only one cycle. In [10] we have shown that the family Ψ(T) of a forest T forms a greedoid on its vertex set. Bipartite, triangle-free, and well-covered graphs G whose Ψ(G) form greedoids were analyzed in [11, 12, 16], respectively. In this paper we characterize the unicycle graphs whose families of local maximum stable sets form greedoids. |
| File Format | |
| Publisher Date | 2009-01-01 |
| Access Restriction | Open |
| Subject Keyword | Unicycle Graph Vertex Set Local Maximum Stable Set Maximum Size Stable Set Form Greedoids Maximum Stable Set Well-covered Graph |
| Content Type | Text |
| Resource Type | Article |
