Remarks on the largest eigenvalue of a signed graph
From MaRDI portal
Publication:6166492
DOI10.1007/S40840-023-01549-4zbMATH Open1519.05104MaRDI QIDQ6166492FDOQ6166492
Authors: Kaiyang Lan, Jianxi Li
Publication date: 2 August 2023
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Signed and weighted graphs (05C22)
Cites Work
- Some Inequalities for the Largest Eigenvalue of a Graph
- On the spectral radius of (0,1)-matrices
- Title not available (Why is that?)
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Lower bounds for the clique and the chromatic numbers of a graph
- Walks and the spectral radius of graphs
- Spectral bounds for the clique and independence numbers of graphs
- A bound on the spectral radius of graphs with \(e\) edges
- A conjecture on the spectral radius of graphs
- Sharp upper bounds of the spectral radius of a graph
- Signed spectral Turań-type theorems
- Eigenvalues and chromatic number of a signed graph
- A note on eigenvalues of signed graphs
Cited In (6)
- Extremal spectral results related to spanning trees of signed complete graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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)