Linear maps on nonnegative symmetric matrices preserving the independence number

preprint2022arXivOpen access

Abstract

The independence number of a square matrix AA, denoted by α(A)α(A), is the maximum order of its principal zero submatrices. Let Sn+S_n^{+} be the set of n×nn\times n nonnegative symmetric matrices with zero trace. Denote by JnJ_n the n×nn\times n matrix with all entries equal to one. Given any integer nn, we prove that a linear map ϕ:Sn+→Sn+ϕ: S_n^+\rightarrow S_n^+ satisfies α(ϕ(X))=α(X)for allX∈Sn+α(ϕ(X))= α(X) {\quad\rm for~ all\quad}X\in S_n^+ if and only if there is a permutation matrix PP such that ϕ(X)=H∘(PTXP)for allX∈Sn+,ϕ(X)=H\circ(P^TXP)\quad { \rm for~ all\quad}X\in S_n^+, where H=ϕ(Jn−In)H=ϕ(J_n-I_n) with all off-diagonal entries positive.

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.