Matroids arisen from matrogenic graphs Original Research Article

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