05C50 Online Seminar: Luiz Emilio Allem
Topic
Title: q(G) for Threshold Graphs
Speakers
Details
Abstract: We study the minimum number of distinct eigenvalues q(G) of threshold graphs. It is known that every threshold graph satisfies q(G) at most 4, which suggests that a complete combinatorial characterization according to the values q(G) = 2, 3, 4 is possible.
In this talk, we present ongoing results toward such a characterization.
Preprint: https://arxiv.org/abs/2402.07078
Additional Information
The 05C50 Online is an international seminar about graphs and matrices held twice a month on Fridays. This is organized by Stephen Kirkland (University of Manitoba), Hermie Monterde (University of Regina) and Homer de Vera (University of Manitoba).
Time: 8 AM Pacific / 10 AM 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.
