Strongly Regular Graphs with Maximal Energy

By Willem H. Haemers. 2007

64 citations recorded by the source corpus.

Subfields: Discrete Mathematics and Combinatorics, Electrical and Electronic Engineering, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/e551cec5f4f452dbe0f839760aafe6bc056b04fb

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Discrete Mathematics and Combinatorics

1. Vladimir Nikiforov
2. L. Lov'asz
3. Peter Rowlinson
4. Christian Reiher
5. Yongtao Li
6. David Conlon
7. Joonkyung Lee
8. Lihua Feng

In Electrical and Electronic Engineering

1. Vladimir Nikiforov

In Geometry and Topology

1. Vladimir Nikiforov
2. Yongtao Li
3. L. Lov'asz
4. Peter Rowlinson
5. Christian Reiher
6. Xiaodong Zhang
7. Lihua Feng
8. Weijun Liu

Citations in the corpus

• Spectra of Graphs (2011, unknown): “4, and [213].”
• Seidel Switching and Graph Energy (2012, unknown): “See [4] and [5] for more about maximal energy graphs.”
• Beyond graph energy: norms of graphs and matrices (2015, background): “2 (noted for graphs by Haemers in [19]) gives a sharper description of the extremal graphs and matrices, and exhibits the strong bonds between matrix norms and Hadamard matrices.”