Employing star complements in search for graphs with fixed rank
From MaRDI portal
Cites work
- A characterization of graphs with rank 4
- A characterization of graphs with rank 5
- A study of eigenspaces of graphs
- An extension of the star complement technique for regular graphs
- An introduction to the theory of graph spectra
- Characterizing Graphs with Nullity n-4
- scientific article; zbMATH DE number 3756522 (Why is no real title available?)
- scientific article; zbMATH DE number 3790468 (Why is no real title available?)
- scientific article; zbMATH DE number 11798 (Why is no real title available?)
- scientific article; zbMATH DE number 540115 (Why is no real title available?)
- scientific article; zbMATH DE number 2117218 (Why is no real title available?)
- Inequalities for Graph Eigenvalues
- Maximal canonical graphs with seven nonzero eigenvalues
- Maximal graphs with respect to rank
- On bipartite graphs with complete bipartite star complements
- On graphs whose second largest eigenvalue equals 1 -- the star complement technique
- On graphs with complete bipartite star complements
- On graphs with prescribed star complements
- On the characterization of graphs by star complements
- On the nullity of tricyclic graphs
- Practical graph isomorphism. II.
- Regular graphs with a prescribed complete multipartite graph as a star complement
- Regular graphs. A spectral approach
- Some characterizations of graphs by star complements
- Some star complements for the second largest eigenvalue of a graph
- Star complements in regular graphs: old and new results
Cited in
(2)
This page was built for publication: Employing star complements in search for graphs with fixed rank
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6987117)
