Czechoslovak Mathematical Journal, first online, pp. 1-14
Tridiagonal matrices and spectral properties of some graph classes
Milica Anđelić, Zhibin Du, Carlos M. da Fonseca, Slobodan K. Simić
Received April 17, 2019. Published online April 23, 2020.
Abstract: A graph is called a chain graph if it is bipartite and the neighbourhoods of the vertices in each colour class form a chain with respect to inclusion. In this paper we give an explicit formula for the characteristic polynomial of any chain graph and we show that it can be expressed using the determinant of a particular tridiagonal matrix. Then this fact is applied to show that in a certain interval a chain graph does not have any nonzero eigenvalue. A similar result is provided for threshold graphs.
Affiliations: Milica Anđelić (corresponding author), Department of Mathematics, Faculty of Science, Kuwait University, P.O. Box 5969, Safat 13060, Kuwait, e-mail: email@example.com; Zhibin Du, School of Software, South China Normal University, Foshan, Guangdong 528225, P. R. China, School of Mathematics and Statistics, Zhaoqing University, Zhaoqing 526061, Guangdong, P. R. China, e-mail: firstname.lastname@example.org; Carlos M. da Fonseca, Kuwait College of Science and Technology, Doha District, Block 4, P.O. Box 27235, Safat 13133, Kuwait, e-mail: email@example.com, University of Primorska, FAMNIT, Glagoljsaška 8, 6000 Koper, Slovenia, e-mail: firstname.lastname@example.org; Slobodan K. Simić, Mathematical Institute SANU, Kneza Mihaila 36, 11 000 Belgrade, Serbia, e-mail: email@example.com