The clique number of the exact distance \(t\)-power graph: complexity and eigenvalue bounds
From MaRDI portal
Publication:6671386
DOI10.1016/j.dam.2024.11.032MaRDI QIDQ6671386
Afrouz Jabal Ameli, Luuk Reijnders, Aida Abiad
Publication date: 27 January 2025
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Other types of codes (94B60) Distance in graphs (05C12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
This page was built for publication: The clique number of the exact distance \(t\)-power graph: complexity and eigenvalue bounds
