A matroid characterization of the combinatorially symmetric maximum nullity of a graph

From MaRDI portal
















This page was built for publication: A matroid characterization of the combinatorially symmetric maximum nullity of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7447598)