On joins of a clique and a co-clique as star complements in regular graphs
From MaRDI portal
Publication:2164977
DOI10.1007/s10801-022-01115-4zbMath1495.05181arXiv1912.07594OpenAlexW4205382343MaRDI QIDQ2164977
Publication date: 18 August 2022
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.07594
Combinatorial aspects of block designs (05B05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Regular graphs. A spectral approach
- On graphs whose second largest eigenvalue equals 1 -- the star complement technique
- Star complements in regular graphs: old and new results
- An extension of the star complement technique for regular graphs
- On graphs with prescribed star complements
- Some characterizations of graphs by star complements
- On bipartite graphs with complete bipartite star complements
- Regular graphs with a prescribed complete multipartite graph as a star complement
- On the characterization of graphs by star complements
- On independent star sets in finite graphs
- Unions of a clique and a co-clique as star complements for non-main graph eigenvalues
- Star complements and maximal exceptional graphs
- On graphs with complete bipartite star complements
- Fisher's inequality for designs on regular graphs
This page was built for publication: On joins of a clique and a co-clique as star complements in regular graphs
