Strong star complements in graphs
From MaRDI portal
Publication:6124250
DOI10.1016/j.laa.2024.01.025MaRDI QIDQ6124250
Peter Rowlinson, Milica Anđelić, Zoran Stanić
Publication date: 27 March 2024
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
eigenvaluestrongly regular graphadjacency matrixline graphstar complementexceptional graphstar partition
Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Regular star complements in strongly regular graphs
- On graphs whose second largest eigenvalue equals 1 -- the star complement technique
- Star complements in regular graphs: old and new results
- Characterizing line graphs by star complements
- On the spectrum of a complete multipartite graph
- On graphs whose star complement for \(-2\) is a path or a cycle
- On graphs with prescribed star complements
- Graphs with least eigenvalue \(-2\); a historical survey and recent developments in maximal exceptional graphs
- Star partitions and regularity in graphs
- On joins of a clique and a co-clique as star complements in regular graphs
- Regular graphs with a prescribed complete multipartite graph as a star complement
- Controllability of undirected graphs
- Strongly regular graphs with strongly regular decomposition
- Some star complements for the second largest eigenvalue of a graph
- ON THE MULTIPLICITIES OF GRAPH EIGENVALUES
- Inequalities for Graph Eigenvalues
- Star complements and maximal exceptional graphs
