On the relative position of multiple eigenvalues in the spectrum of an Hermitian matrix with a given graph

By Charles R. Johnson, António Leal Duarte, Carlos M. Saiago, Brian D. Sutton, Andrew J. Witt. 2003

47 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Electrical and Electronic Engineering, Geometry and Topology

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

How researchers see this paper

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

In Computational Theory and Mathematics

1. Leslie Hogben
2. Shaun M. Fallat
3. Francesco Barioli
4. Darren D. Row
5. Samet Oymak
6. Necmiye Ozay

In Electrical and Electronic Engineering

1. Shaun M. Fallat
2. Leslie Hogben

In Geometry and Topology

1. Leslie Hogben
2. Shaun M. Fallat
3. Francesco Barioli
4. Darren D. Row
5. Thomas Zaslavsky
6. Samet Oymak
7. Necmiye Ozay

Citations in the corpus

• Computation of minimal rank and path cover number for certain graphs (2004, background): “Since, as noted in [7], for each vertex v of a tree T , whose degree is larger than or equal to 3, it is possible to construct a matrix A with v as Parter–Wiener vertex for an eigenvalue of A, we can easily construct a Parter–Wiener vertex for a matrix A which is not a rank-strong vertex for T = G(A”