Algebraic Combinatorics Seminar - Krystal Guo
Title: Inverses of Trees
Speaker: | Krystal Guo |
Affiliation: | Centre de Recherches Mathématiques & Université de Montréal |
Room: | MC 5417 |
Abstract:
A tree is invertible if and only if it has a perfect matching.
Godsil considers an invertible tree T and finds that the inverse of the adjacency matrix has entries in {0, ±1} and is the signed adjacency matrix of a graph which contains T.