Matroids arisen from matrogenic graphs
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 . In this paper, we characterize matroids arising from matrogenic graphs.
Publication Source (Journal or Book title)
Ding, G., & Hammer, P. (1997). Matroids arisen from matrogenic graphs. Discrete Mathematics, 165-166, 211-217. https://doi.org/10.1016/S0012-365X(96)00171-9