Title: Uniformity in Kirchhoff Graphs
ABSTRACT: One of the first things that might be noticed about Kirchhoff graphs is that in many but not all cases, the number of times each edge vector of occurs in the graph is constant. This talk will discuss this issue in some detail. First a linear algebraic formulation of Kirchhoff will be derived, and then this formulation will be used to show that 2-connected Kirchhoff graphs are always uniform— —each edge vector occurs a fixed number of times.
Tuesday, October 9, 2018
Stratton Hall 106