Skew-signings of positive weighted digraphs

Abstract: An arc-weighted digraph is a pair

(D, o m e g a)

where

D

is a digraph and

o m e g a

is an emph{arc-weight function} that assigns to each arc

u v

of

D

a nonzero real number

o m e g a (u v)

. Given an arc-weighted digraph

(D, o m e g a)

with vertices

v_{1}, l d o t s, v_{n}

, the weighted adjacency matrix of

(D, o m e g a)

is defined as the matrix

A (D, o m e g a) = [a_{i j}]

where

a_{i j} = o m e g a (v_{i} v_{j})

, if

v_{i} v_{j}

an arc of

D

and

0

otherwise. Let

(D, o m e g a)

be a positive arc-weighted digraphs and assume that

D

is loopless and symmetric. A skew-signing of

(D, o m e g a)

is an arc-weight function

o m e g a^{p r i m e}

such that

o m e g a^{p r i m e} (u v) = p m o m e g a (u v)

and

o m e g a^{p r i m e} (u v) o m e g a^{p r i m e} (v u) < 0

for every arc

u v

of

D

. In this paper, we give necessary and sufficient conditions under which the characteristic polynomial of

A (D, o m e g a^{p r i m e})

is the same for every skew-signing

o m e g a^{p r i m e}

of

(D, o m e g a)

. Our Main Theorem generalizes a result of Cavers et al (2012) about skew-adjacency matrices of graphs.

Recommendations

Cites work

This page was built for publication: Skew-signings of positive weighted digraphs