IDR Logo

Please use this identifier to cite or link to this item: http://idr.iitbbs.ac.in/jspui/handle/2008/5750
Title: On integer matrices with integer eigenvalues and Laplacian integral graphs
Authors: Barik S.; Behera S.
Keywords: Graph; Integer eigenvalues; Integer matrix; Laplacian matrix; Threshold graph
Issue Date: 2024
Citation: 1
Abstract: A matrix A is said to be an integer matrix if all its entries are integers. In this article, we characterize the nonsingular integer matrices with integer eigenvalues in an expressible form of their corresponding inverse matrices. It is proved that a nonsingular integer matrix A has integer eigenvalues if and only if A?1 can be written as the sum of n rank-one matrices that meet certain requirements. A method for constructing integer matrices with integer eigenvalues using the Hadamard product is also provided. Let S represent an n-tuple of nonnegative integers. If there is an n�n integer matrix A whose spectrum (the collection of eigenvalues) is S, we say that S is realisable by an integer matrix. In Fallat et al. (2005) [7], the authors posed a conjecture that �there is no simple graph on n?2 vertices whose Laplacian spectrum is given by (0,1,�,n?1).� We provide a characterization of threshold graphs using the spectra of quotient matrices of its G-join graphs. As a consequence, we prove that given any n?1 positive integers ?2,�,?n such that ?2????n, the n-tuple (0,?2,�,?n) is realizable by the Laplacian matrix of a multidigraph. In particular, we show that (0,1,�,n?1) can be realizable by the Laplacian matrix of a multidigraph. � 2023 Elsevier B.V.
URI: http://dx.doi.org/10.1016/j.disc.2023.113707
http://idr.iitbbs.ac.in/jspui/handle/2008/5750
Appears in Collections:Research Publications

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.