王世英, 殷志祥
Abstract
Let G be a simple graph and I={S:S is extreme in G},If M(V(G),I) is a matroid ,then G is called an extreme matroid graph,In this paper,we study the properties of extreme matroid graph.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Let G be a simple graph and I={S:S is extreme in G},If M(V(G),I) is a matroid ,then G is called an extreme matroid graph,In this paper,we study the properties of extreme matroid graph.
Key concepts: Matroid, Graphic matroid, Combinatorics, Matroid partitioning, Oriented matroid, Weighted matroid, Mathematics, Discrete mathematics