10:35 A Conjecture in Combinatorial Matrix Theory
Brualdi, Richard A.
University of Wisconsin, Madison, USA
11:00
Title to be announced
Hershkowitz, Danny
Technion, Israel
11:25 Constructing Laplacian Integral Split Graphs
Kirkland, Steve
University of Regina, Canada
(with N. Abreu, M. de Freitas and R. Del Vecchio)
11:50 Potential Diagonal and D-convergence
Pryporova, Olga
Iowa State University, Ames, IA, USA
12:15 The Colin de Verdière Parameter- a progress report
Berman, Avi
Technion, Tel Aviv, Israel
10:35 Minimum rank of edge subdivisions of complete graphs and wheels
Barrett, Wayne
Brigham Young University, Utah
(with Ryan Bowcutt, Mark Cutler, Seth Gibelyou, and Kayla Owens)
11:00 Computing the minimum rank of partial $2$-trees
van der Holst, Hein
Eindhoven University of Technology, The Nederlands
11:25 Characterizing graphs with minimum rank at most a given number over a finite field using polarities of projective geometries
Grout, Jason
Iowa State University, Ames, IA, USA
11:50 Average minimum rank of a graph
Shader, Bryan
University of Wyoming, USA
(with Francesco Barioli, Shaun Fallat, Tracy Hall, Daniel Hershkowitz, Leslie Hogben, Ryan Martin, and Hein van der Holst)
12:15 The graph and rank of a positive semidefinite matrix
Deaett, Louis
University of Wisconsin, Madison, USA
15:30
Group Inverses of Matrices with Path Graphs
Olesky, Dale
University of Victoria, Canada,
(with M. Catral and P. van den Driessche)
15:55 Sparse Inertially Arbitrary Sign Patterns
Vander Meulen, Kevin
Redeemer College, Canada
(with L. Vanderspek and M. Cavers)
16:20 The Q-matrix completion problem
DeAlba, Luz
Drake University, Des Moines, IA, USA
(with Leslie Hogben and Bhaba Sharma)
16:45 Maximizing spectral radius of unoriented Laplacian matrix
Tam, Bit-Shun
Tamkang University, Tamsui, Taiwan
(with Ding-Jung Chang and Shui-Hei Wu)