The n-Queens graph and its generalizations

• Autor(a) principal: Costa, Inês Filipa Serôdio
• Data de Publicação: 2024
• Idioma: eng
• Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
• Texto Completo: http://hdl.handle.net/10773/41899
• topic: Graph spectra; Integer eigenvalues; Least eigenvalue of a graph; Edge clique partition; Queens graph; Integral graph

This thesis presents some spectral results related to the n-Queens graph – a graph associated with the n × n chessboard, with n ∈ N – and its generalizations. A lower (and upper) bound is established for the least eigenvalue of a graph, using the concept of edge clique partition. Applying this bound, throughout the thesis, lower bounds are established for the least eigenvalue of the n-Queens graph and of some of its generalizations – for m × n rectangular chessboards ( Q (m, n )) and n × n × n chessboards ( Q (n, n, n )), m, n ∈ N. Other integer eigenvalues for these graphs, as well as eigenvectors associated with them, are studied. Finally, an integral graph – a graph whose spectrum is entirely composed of integer eigenvalues – is introduced which is, like Q (n, n ) and Q (m, n ), an induced subgraph of Q (n, n, n ).