Previous |  Up |  Next

Article

Full entry | Fulltext not available (moving wall 24 months)      Feedback
Keywords:
tridiagonal matrix; threshold graph; chain graph; eigenvalue-free interval
Summary:
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.
References:
[1] Aguilar, C. O., Lee, J.-Y., Piato, E., Schweitzer, B. J.: Spectral characterizations of anti-regular graphs. Linear Algebra Appl. 557 (2018), 84-104. DOI 10.1016/j.laa.2018.07.028 | MR 3848263 | Zbl 1396.05064
[2] Alazemi, A., elić, M. Anđ, Simić, S. K.: Eigenvalue location for chain graphs. Linear Algebra Appl. 505 (2016), 194-210. DOI 10.1016/j.laa.2016.04.030 | MR 3506491 | Zbl 1338.05155
[3] elić, M. Anđ, Andrade, E., Cardoso, D. M., Fonseca, C. M. da, Simić, S. K., Tošić, D. V.: Some new considerations about double nested graphs. Linear Algebra Appl. 483 (2015), 323-341. DOI 10.1016/j.laa.2015.06.010 | MR 3378905 | Zbl 1319.05084
[4] elić, M. Anđ, Fonseca, C. M. da: Sufficient conditions for positive definiteness of tridiagonal matrices revisited. Positivity 15 (2011), 155-159 \99999DOI99999 10.1007/s11117-010-0047-y \goodbreak. DOI 10.1007/s11117-010-0047-y | MR 2782752 | Zbl 1216.15022
[5] elić, M. Anđ, Ghorbani, E., Simić, S. K.: Vertex types in threshold and chain graphs. Discrete Appl. Math. 269 (2019), 159-168. DOI 10.1016/j.dam.2019.02.040 | MR 4016594 | Zbl 1421.05062
[6] elić, M. Anđ, Simić, S. K., Živković, D., Dolićanin, E. Ć.: Fast algorithms for computing the characteristic polynomial of threshold and chain graphs. Appl. Math. Comput. 332 (2018), 329-337. DOI 10.1016/j.amc.2018.03.024 | MR 3788693 | Zbl 1427.05127
[7] Cvetković, D., Rowlinson, P., Simić, S.: An Introduction to the Theory of Graph Spectra. London Mathematical Society Student Texts 75, Cambridge University Press, Cambridge (2010). DOI 10.1017/CBO9780511801518 | MR 2571608 | Zbl 1211.05002
[8] Fonseca, C. M. da: On the eigenvalues of some tridiagonal matrices. J. Comput. Appl. Math. 200 (2007), 283-286. DOI 10.1016/j.cam.2005.08.047 | MR 2276832 | Zbl 1119.15012
[9] Ghorbani, E.: Eigenvalue-free interval for threshold graphs. Linear Algebra Appl. 583 (2019), 300-305. DOI 10.1016/j.laa.2019.08.028 | MR 4002158 | Zbl 1426.05096
[10] Jacobs, D. P., Trevisan, V., Tura, F.: Eigenvalues and energy in threshold graphs. Linear Algebra Appl. 465 (2015), 412-425. DOI 10.1016/j.laa.2014.09.043 | MR 3274686 | Zbl 1302.05103
[11] Lazzarin, J., Márquez, O. F., Tura, F. C.: No threshold graphs are cospectral. Linear Algebra Appl. 560 (2019), 133-145. DOI 10.1016/j.laa.2018.09.033 | MR 3866549 | Zbl 1401.05152
[12] Maybee, J. S., Olesky, D. D., Driessche, P. van den, Wiener, G.: Matrices, digraphs, and determinants. SIAM J. Matrix Anal. Appl. 10 (1989), 500-519. DOI 10.1137/0610036 | MR 1016799 | Zbl 0701.05038
Partner of
EuDML logo