pith. sign in

arxiv: 1405.6000 · v1 · pith:ZHDL6H6Lnew · submitted 2014-05-23 · 🧮 math.CO

On a Problem of Harary and Schwenk on Graphs with Distinct Eigenvalues

classification 🧮 math.CO
keywords problemdistincteigenvaluesmatrixalgebraiccharacterizationconditiongraphs
0
0 comments X
read the original abstract

Harary and Schwenk posed the problem forty years ago: Which graphs have distinct adjacency eigenvalues? In this paper, we obtain a necessary and sufficient condition for an Hermitian matrix with simple spectral radius and distinct eigenvalues. As its application, we give an algebraic characterization to the Harary-Schwenk's problem. As an extension of their problem, we also obtain a necessary and sufficient condition for a positive semidefinite matrix with simple least eigenvalue and distinct eigenvalues, which can provide an algebraic characterization to their problem with respect to the (normalized) Laplacian matrix.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.