HKHaley Knox
Haley Knox
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Haley Knox has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Audrey Goodnight
Agnes Scott College 30030 Decatur GA USA
1 shared publication - Beth Bjorkman
US Air Force Research Laboratory,Dayton,Ohio
1 shared publication Casandra Monroe
Bowdoin College 04011 Brunswick ME USA
1 shared publication- Christine Alar
San Francisco State University 94132 San Francisco CA USA
1 shared publication - John Ahn
Bowdoin College 04011 Brunswick ME USA
1 shared publication Joshua Carlson
Iowa State University 50011 Ames IA USA
1 shared publication
Latest Publications
- Open Access
Ordered multiplicity inverse eigenvalue problem for graphs on six vertices
For a graph $G$, we associate a family of real symmetric matrices, $\mathcal{S}(G)$, where for any $M \in \mathcal{S}(G)$, the location of the nonzero off-diagonal entries of $M$ are governed by the adjacency structure of $G$. The ordered multiplicity Inverse Eigenvalue Problem of a Graph (IEPG) is concerned with finding all attainable ordered lists of eigenvalue multiplicities for matrices in $\mathcal{S}(G)$. For connected graphs of order six, we offer significant progress on the IEPG, as well as a complete solution to the ordered multiplicity IEPG. We also show that while $K_{m,n}$ with $\min(m,n)\ge 3$ attains a particular ordered multiplicity list, it cannot do so with arbitrary spectrum.Open AccessOrdered multiplicity inverse eigenvalue problem for graphs on six vertices
For a graph $G$, we associate a family of real symmetric matrices, $\mathcal{S}(G)$, where for any $M \in \mathcal{S}(G)$, the location of the nonzero off-diagonal entries of $M$ are governed by the adjacency structure of $G$. The ordered multiplicity Inverse Eigenvalue Problem of a Graph (IEPG) is concerned with finding all attainable ordered lists of eigenvalue multiplicities for matrices in $\mathcal{S}(G)$. For connected graphs of order six, we offer significant progress on the IEPG, as well as a complete solution to the ordered multiplicity IEPG. We also show that while $K_{m,n}$ with $\min(m,n)\ge 3$ attains a particular ordered multiplicity list, it cannot do so with arbitrary spectrum.