Generic maximum nullity of a graph

Abstract

For a graph G of order n, the maximum nullity of G is defined to be the largest possible nullity over all real symmetric n × n matrices A whose (i, j)th entry (for i 6= j) is nonzero whenever {i, j} is an edge in G and is zero otherwise. Maximum nullity and the related parameter minimum rank of the same set of matrices have been studied extensively. A new… (More)

Topics

4 Figures and Tables

Cite this paper

@inproceedings{Hogben2008GenericMN, title={Generic maximum nullity of a graph}, author={Leslie Hogben and Bryan L. Shader}, year={2008} }