The inertia set of a signed graph

Publication date 19 February 2014

Abstract: A signed graph is a pair

(G, S i g m a)

, where

G = (V, E)

is a graph (in which parallel edges are permitted, but loops are not) with

V = 1, ..., n

and

S i g m a s u b s e t e q E

. By

S (G, S i g m a)

we denote the set of all symmetric

V i m e s V

matrices

A = [a_{i, j}]

with

a_{i, j} < 0

if

i

and

j

are connected by only even edges,

a_{i, j} > 0

if

i

and

j

are connected by only odd edges,

a_{i, j} i n m a t h b b R

if

i

and

j

are connected by both even and odd edges,

a_{i, j} = 0

if

i o t = j

and

i

and

j

are non-adjacent, and

a_{i, i} i n m a t h b b R

for all vertices

i

. The stable inertia set of a signed graph

(G, S i g m a)

is the set of all pairs

(p, q)

for which there exists a matrix

A i n S (G, S i g m a)

with

p

positive and

q

negative eigenvalues which has the Strong Arnold Property. In this paper, we study the stable inertia set of (signed) graphs.

Recommendations

Cites work

Cited in

(15)

This page was built for publication: The inertia set of a signed graph