Graph products that allow two distinct eigenvalues
From MaRDI portal
Cites work
- A Nordhaus-Gaddum conjecture for the minimum number of distinct eigenvalues of a graph
- Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
- Applications of analysis to the determination of the minimum number of distinct eigenvalues of a graph
- Bordering of symmetric matrices and an application to the minimum number of distinct eigenvalues for the join of graphs
- Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph
- Handbook of product graphs
- Inverse Problems and Zero Forcing for Graphs
- Minimum number of distinct eigenvalues of graphs
- On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree
- Orthogonal symmetric matrices and joins of graphs
- Regular graphs of degree at most four that allow two distinct eigenvalues
- Regular Graphs of High Degree are 1-Factorizable
- Sparsity of graphs that allow two distinct eigenvalues
- The inverse eigenvalue problem of a graph: multiplicities and minors
- The NP-Completeness of Edge-Coloring
- Zero forcing sets and the minimum rank of graphs
- Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre.
This page was built for publication: Graph products that allow two distinct eigenvalues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6908433)