- Series
- Graph Theory Seminar
- Time
- Thursday, November 8, 2012 - 12:05pm for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Hein van der Holst – Georgia State University
- Organizer
- Robin Thomas
A signed graph is a pair (G,Σ) where G is an undirected graph (in which
parallel edges are permitted, but loops are not) and Σ⊆E(G).
The edges in Σ are called odd and the other edges are called even. A
cycle of G is called odd if it has an odd number of odd edges. If U⊆V(G), then re-signing (G,Σ) on U gives the signed graph
(G,ΣΔδ(U)). A signed graph is a minor of (G,Σ) if it
comes from (G,Σ) by a series of re-signing, deletions of edges and
isolated vertices, and contractions of even edges.
If (G,Σ) is a signed graph with n vertices, S(G,Σ) is the set of
all symmetric n×n matrices A=[ai,j] with ai,j>0 if i and
j are connected by only odd edges, ai,j<0 if i and j are connected
by only even edges, ai,j∈R if i and j are connected by
both even and odd edges, ai,j=0 if i and j are not connected by any
edges, and ai,i∈R for all vertices i.
The stable inertia set, Is(G,Σ), of a signed graph (G,Σ) is the
set of all pairs (p,q) such that there exists a matrix A∈S(G,Σ)
that has the Strong Arnold Hypothesis, and p positive and q negative
eigenvalues. The stable inertia set of a signed graph forms a generalization of
μ(G), ν(G) (introduced by Colin de Verdi\`ere), and ξ(G)
(introduced by Barioli, Fallat, and Hogben).
A specialization of Is(G,Σ) is ν(G,Σ), which is defined as the
maximum of the nullities of positive definite matrices A∈S(G,Σ) that
have the Strong Arnold Hypothesis.
This invariant is closed under taking minors, and characterizes signed graphs
with no odd cycles as those signed graphs (G,Σ) with ν(G,Σ)≤1, and signed graphs with no odd-K4- and no odd-K23-minor as those
signed graphs (G,Σ) with ν(G,Σ)≤2. In this talk we will
discuss Is(G,Σ), ν(G,Σ) and these characterizations.
Joint work with Marina Arav, Frank Hall, and Zhongshan Li.