Linear maps on nonnegative symmetric matrices preserving the independence number

Abstract: The independence number of a square matrix

A

, denoted by

a l p h a (A)

, is the maximum order of its principal zero submatrices. Let

S_{n}^{+}

be the set of

n i m e s n

nonnegative symmetric matrices with zero trace. Denote by

J_{n}

the

n i m e s n

matrix with all entries equal to one. Given any integer

n

, we prove that a linear map

p h i : S_{n}^{+} i g h t a r r o w S_{n}^{+}

satisfies

alpha(phi(X))= alpha(X) {quad m for~ allquad}Xin S_n^+

if and only if there is a permutation matrix

P

such that

phi(X)=Hcirc(P^TXP)quad { m for~ allquad}Xin S_n^+,

where

H = p h i (J_{n} - I_{n})

with all off-diagonal entries positive.

Recommendations

Cites work

This page was built for publication: Linear maps on nonnegative symmetric matrices preserving the independence number