Title

Matroids arisen from matrogenic graphs

Document Type

Article

Publication Date

3-15-1997

Abstract

Let G be a finite simple graph and let ℐ(G) be the set of subsets X of V(G) such that the subgraph of G induced by X is threshold. If ℐ(G) is the independence system of a matroid, then G is called matrogenic [3]. In this paper, we characterize matroids arising from matrogenic graphs.

Publication Source (Journal or Book title)

Discrete Mathematics

First Page

211

Last Page

217

This document is currently not available here.

Share

COinS