An extension of the star complement technique for regular graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3670480 (Why is no real title available?)
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- An introduction to the theory of graph spectra
- Eigenvalue multiplicity in cubic graphs
- Line graphs of bipartite graphs with Hamiltonian paths
- ON THE MULTIPLICITIES OF GRAPH EIGENVALUES
- On graphs whose star complement for \(-2\) is a path or a cycle
- Some properties of the Hoffman-Singleton graph
- Star complements and exceptional graphs
- Star complements in regular graphs: old and new results
Cited in
(13)- Graph MBO on star graphs and regular trees. With corrections to DOI 10.1007/s00032-014-0216-8
- Maximal graphs with a prescribed complete bipartite graph as a star complement
- An example of using star complements in classifying strongly regular graphs
- Augmenting chains in graphs without a skew star.
- Regular and maximal graphs with prescribed tripartite graph as a star complement
- Minimal graphs with eigenvalue multiplicity of \(n-d\)
- Regular graphs with a complete bipartite graph as a star complement
- On joins of a clique and a co-clique as star complements in regular graphs
- scientific article; zbMATH DE number 6129645 (Why is no real title available?)
- Co-cliques and star complements in extremal strongly regular graphs
- On graphs whose second largest eigenvalue equals 1 -- the star complement technique
- Star complements in regular graphs: old and new results
- On trees as star complements in regular graphs
This page was built for publication: An extension of the star complement technique for regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1790488)
