Department of Mathematics

Combinatorics and Graph Theory

  •  Tree Cover Number and Maximum Semidefinite Nullity of Graphs Part 2
  •  11/28/2017
  •  4:10 PM - 5:00 PM
  •  C304 Wells Hall
  •  Rachel Domagalski, Michigan State University

In this talk, we continue our discussion of the tree cover number of a graph and its relationship to maximum semidefinite nullity. We find the tree cover number of line graphs, shadow graphs, corona of two graphs, cartesian product of two graphs, and a few more. In these cases, we verify the conjecture: the tree cover number of a graph is less than or equal to the maximum semidefinite nullity of its associated complex Hermitian matrix.

 

Contact

Department of Mathematics
Michigan State University
619 Red Cedar Road
C212 Wells Hall
East Lansing, MI 48824

Phone: (517) 353-0844
Fax: (517) 432-1562

College of Natural Science