05C50 Online Seminar: Mahsa Shirazi

  • Date: 02/10/2023
  • Time: 08:00
Mahsa Shirazi



On weakly Hadamard diagonalizable graphs


An interesting question in spectral graph theory is about the structure of the eigenvectors of matrices associated with graphs. A graph is weakly Hadamard diagonalizable (WHD) if its Laplacian matrix L can be diagonalized with a weakly Hadamard matrix. In other words, if L = PDP^{-1} , where D is a diagonal matrix and P has the property that all entries in P are from {0,-1,1} and that P^TP is a tridiagonal matrix. In this talk, I will present some necessary and sufficient conditions for a graph to be WHD. Some families of graphs whichare WHD will also be presented.

This work is part of a research project done with the discrete math research group (DMRG) at the University of Regina.


Stephen Kirkland, University of Manitoba 

Hermie Monterde, University of Manitoba

Other Information: 

The 05C50 Online is an international seminar about graphs and matrices held twice a month on Fridays.


Time: 8AM Pacific/10AM Central 


For more information, visit https://sites.google.com/view/05c50online/home


If you would like to attend, please register using this form to receive the zoom links: https://docs.google.com/forms/d/e/1FAIpQLSdQ98fh58cgeSWzbFe3t77i28FXDck1gYuX9jv_qd4kEf5l_Q/viewform?usp=sf_link