On a question of Haemers regarding vectors in the nullspace of Seidel matrices

by   Saieed Akbari, et al.

In 2011, Haemers asked the following question: If S is the Seidel matrix of a graph of order n and S is singular, does there exist an eigenvector of S corresponding to 0 which has only ± 1 elements? In this paper, we construct infinite families of graphs which give a negative answer to this question. One of our constructions implies that for every natural number N, there exists a graph whose Seidel matrix S is singular such that for any integer vector in the nullspace of S, the absolute value of any entry in this vector is more than N. We also derive some characteristics of vectors in the nullspace of Seidel matrices, which lead to some necessary conditions for the singularity of Seidel matrices. Finally, we obtain some properties of the graphs which affirm the above question.



There are no comments yet.


page 1

page 2

page 3

page 4


Singular vector and singular subspace distribution for the matrix denoising model

In this paper, we study the matrix denosing model Y=S+X, where S is a lo...

Singular Vectors From Singular Values

In the recent paper <cit.>, Denton et al. provided the eigenvector-eigen...

Divergent permutations

Two permutations of the natural numbers diverge if the absolute value of...

FPT-algorithms for some problems related to integer programming

In this paper, we present FPT-algorithms for special cases of the shorte...

The Spectrum of the Singular Values of Z-Shaped Graph Matrices

Graph matrices are a type of matrix which appears when analyzing the sum...

Deterministic Completion of Rectangular Matrices Using Asymmetric Ramanujan Graphs

In this paper we study the matrix completion problem: Suppose X ∈R^n_r ×...

Personalized PageRank dimensionality and algorithmic implications

Many systems, including the Internet, social networks, and the power gri...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.