A graph minors characterization of signed graphs whose signed Colin de Verdière parameter νν is two

preprint2012arXivOpen access

Abstract

A signed graph is a pair (G,Σ)(G,Σ), where G=(V,E)G=(V,E) is a graph (in which parallel edges are permitted, but loops are not) with V={1,...,n}V=\{1,...,n\} and Σ⊆EΣ\subseteq E. The edges in ΣΣ are called odd and the other edges even. By S(G,Σ)S(G,Σ) we denote the set of all symmetric n×nn\times n matrices A=[ai,j]A=[a_{i,j}] with ai,j<0a_{i,j}<0 if ii and jj are connected by only even edges, ai,j>0a_{i,j}>0 if ii and jj are connected by only odd edges, ai,j∈Ra_{i,j}\in \mathbb{R} if ii and jj are connected by both even and odd edges, ai,j=0a_{i,j}=0 if i≠ji\not=j and ii and jj are non-adjacent, and ai,i∈Ra_{i,i} \in \mathbb{R} for all vertices ii. The parameter ν(G,Σ)ν(G,Σ) of a signed graph (G,Σ)(G,Σ) is the largest nullity of any positive semidefinite matrix A∈S(G,Σ)A\in S(G,Σ) that has the Strong Arnold Property. By K3=K_3^= we denote the signed graph obtained from (K3,∅)(K_3,\emptyset) by adding to each even edge an odd edge in parallel. In this paper, we prove that a signed graph (G,Σ)(G,Σ) has ν(G,Σ)≤2ν(G,Σ)\leq 2 if and only if (G,Σ)(G,Σ) has no minor isomorphic to (K4,E(K4))(K_4,E(K_4)) or K3=K_3^=.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.