Abstract

A P-set of a symmetric matrix AA is a set αα of indices such that the nullity of the matrix obtained from AA by removing rows and columns indexed by αα is ∣α∣|α| more than that of AA. It is known that each subset of a P-set is a P-set. It is also known that a set of indices such that each singleton subset is a P-set need not be a P-set. This note shows that if all pairs of vertices of a set with at least two elements are P-sets, then the set is a P-set.

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.