Generalizations of some Nordhaus–Gaddum‐type results on spectral radius
From MaRDI portal
Publication:6088224
DOI10.1002/jcd.21919OpenAlexW4386931082MaRDI QIDQ6088224
Yaojun Chen, Junying Lu, Lanchao Wang
Publication date: 13 December 2023
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.21919
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Unnamed Item
- Eigenvalue problems of Nordhaus--Gaddum type
- Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph
- On a conjecture of V. Nikiforov
- A bound on the spectral radius of graphs with \(e\) edges
- A survey of Nordhaus-Gaddum type relations
- A sharp upper bound for the spectral radius of the Nordhaus-Gaddum type
- Proof of a conjecture of V. Nikiforov
- Some Inequalities for the Largest Eigenvalue of a Graph
- On Complementary Graphs
- Edges Not Covered by Monochromatic Bipartite Graph
This page was built for publication: Generalizations of some Nordhaus–Gaddum‐type results on spectral radius