Remarks on the largest eigenvalue of a signed graph
From MaRDI portal
Publication:6166492
Recommendations
Cites work
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- A bound on the spectral radius of graphs with \(e\) edges
- A conjecture on the spectral radius of graphs
- A note on eigenvalues of signed graphs
- Eigenvalues and chromatic number of a signed graph
- Lower bounds for the clique and the chromatic numbers of a graph
- Maxima for Graphs and a New Proof of a Theorem of Turán
- On the spectral radius of (0,1)-matrices
- Sharp upper bounds of the spectral radius of a graph
- Signed spectral Turań-type theorems
- Some Inequalities for the Largest Eigenvalue of a Graph
- Spectral bounds for the clique and independence numbers of graphs
- Walks and the spectral radius of graphs
Cited in
(6)- Extremal spectral results related to spanning trees of signed complete graphs
- scientific article; zbMATH DE number 5811301 (Why is no real title available?)
- scientific article; zbMATH DE number 7157359 (Why is no real title available?)
- A remark on eigen values of signed graph
- Bounding the largest eigenvalue of signed graphs
- Estimating distance between an eigenvalue of a signed graph and the spectrum of an induced subgraph
This page was built for publication: Remarks on the largest eigenvalue of a signed graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166492)