Universal spectra of the disjoint union of regular graphs
Haemers,Willem H. Oboudi,Mohammad Reza
Haemers,Willem H.
Oboudi,Mohammad Reza
Abstract
A universal adjacency matrix of a graph G with adjacency matrix A is any matrix of the form U=αA+βI+γJ+δD with α≠0, where I is the identity matrix, J is the all-ones matrix and D is the diagonal matrix with the vertex degrees. In the case that G is the disjoint union of regular graphs, we present an expression for the characteristic polynomials of the various universal adjacency matrices in terms of the characteristic polynomials of the adjacency matrices of the components. As a consequence we obtain a formula for the characteristic polynomial of the Seidel matrix of G, and the signless Laplacian of the complement of G (i.e. the join of regular graphs). The main tool is a simple but useful lemma on equitable matrix partitions. With this note we also want to propagate this technique.
Description
Date
2020-12
Journal Title
Journal ISSN
Volume Title
Publisher
Research Projects
Organizational Units
Journal Issue
Keywords
Characteristic polynomial, Graph spectrum, Laplacian, Seidel matrix, Signless Laplacian, Universal adjacency matrix
Citation
Haemers, W H & Oboudi, M R 2020, 'Universal spectra of the disjoint union of regular graphs', Linear Algebra and its Applications, vol. 606, pp. 244-248. https://doi.org/10.1016/j.laa.2020.07.033