On eigenvalues of Seidel matrices and Haemers' conjecture

DOI10.1007/S10623-016-0248-XMaRDI QIDQ2364637zbMATH OpenOpenAlexWikidataFDO

Authors E. Ghorbani

Publication date 21 July 2017

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1301.0075

zbMATH Keywords

graph eigenvaluesKKT methodSeidel energySeidel matrixself-complementary graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Abstract: For a graph $G$, let $S(G)$ be the Seidel matrix of $G$ and $e_1(G),\mathrm{...},e_n(G)$ be the eigenvalues of $S(G)$. The Seidel energy of $G$ is defined as $|e_1(G)|+\mathrm{...}+|e_n(G)|$. Willem Haemers conjectured that the Seidel energy of any graph with $n$ vertices is at least $2n-2$, the Seidel energy of the complete graph with $n$ vertices. Motivated by this conjecture, we prove that for any $al$ with $0<al<2$, $|e_1(G){|}^{a}l+\mathrm{...}+|e_n(G){|}^{a}lg(n-1{)}^{a}l+n-1$ if and only if $|mdetS(G)|gn-1$. This, in particular, implies the Haemers' conjecture for all graphs $G$ with $|mdetS(G)|gn-1$.

Recommendations

• Proof of a conjecture on the Seidel energy of graphs
• Energy and Seidel energy of graphs
• An improved lower bound for the Seidel energy of trees
• Improving a lower bound for Seidel energy of graphs
• Some properties of eigenvalues of the Seidel matrix

Cites work

• p-free ^p inequalities
• A relation between the Laplacian and signless Laplacian eigenvalues of a graph
• A two-parameter family of complex Hadamard matrices of order 6 induced by hypocycloids
• Equiangular lines in Euclidean spaces
• scientific article; zbMATH DE number 3482386 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• Maximum Properties and Inequalities for the Eigenvalues of Completely Continuous Operators
• On sum of powers of the Laplacian and signless Laplacian eigenvalues of graphs
• On the distribution of the roots of certain symmetric matrices
• Seidel switching and graph energy
• The energy of graphs and matrices
• The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
• Two-Graphs, Switching Classes and Euler Graphs are Equal in Number

Cited in

(21)

• Enumeration of Seidel matrices
• On Hanlon's eigenvalue conjecture
• Proof of a conjecture on the Seidel energy of graphs
• An improved lower bound for the Seidel energy of trees
• On a question of Haemers regarding vectors in the nullspace of Seidel matrices
• Determinants of Seidel matrices and a conjecture of Ghorbani
• UPPER AND LOWER BOUNDS FOR THE POWER OF EIGENVALUES IN SEIDEL MATRIX
• scientific article; zbMATH DE number 6957159 (Why is no real title available?)
• On the Seidel Laplacian and Seidel signless Laplacian polynomials of graphs
• Improving a lower bound for Seidel energy of graphs
• SEIDEL SPECTRUM OF THE ZERO-DIVISOR GRAPH ON THE RING OF INTEGERS MODULO n
• On the spectrum of some signed complete and complete bipartite graphs
• Open problems in the spectral theory of signed graphs
• Energy and Seidel energy of graphs
• The change of Seidel energy of tripartite Turán graph due to edge deletion
• Hermitian matrices of roots of unity and their characteristic polynomials
• Graphs with at most Four Seidel Eigenvalues
• On the Sα-matrix of graphs
• The change of Seidel energy of 5-partite Turán graph due to edge deletion
• A short proof of Haemers' conjecture on the Seidel energy of graphs
• On the eigenvalues and energy of the Seidel and Seidel Laplacian matrices of graphs

This page was built for publication: On eigenvalues of Seidel matrices and Haemers' conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2364637)