The following pages link to (Q3950585):
Displaying 16 items.
- Graph theoretic aspects of maximizing the spectral radius of nonnegative matrices (Q677122) (← links)
- Graphs with a common eigenvalue deck (Q957997) (← links)
- On a conjecture of He concerning the spectral reconstruction of matrices (Q1043842) (← links)
- Dwarf, brick, and triangulation of the torus (Q1096655) (← links)
- Tight bounds on the spectral radius of asymmetric nonnegative matrices (Q1108348) (← links)
- Constructing trees with given eigenvalues and angles (Q1124609) (← links)
- Polynomial reconstruction and terminal vertices (Q1855397) (← links)
- \(k\)-spectrally monomorphic tournaments (Q2113359) (← links)
- The idiosyncratic polynomial of digraphs (Q2155544) (← links)
- Some results on the spectral reconstruction problem (Q2383024) (← links)
- Reconstructing subgraph-counting graph polynomials of increasing families of graphs (Q2566153) (← links)
- The polynomial reconstruction problem: the first 50 years (Q2699914) (← links)
- On the Characteristic Equations of the Characteristic Polynomial (Q3220631) (← links)
- (Q5060665) (← links)
- Polynomial reconstruction problem for hypergraphs (Q6496383) (← links)
- Construction of cospectral graphs, signed graphs and \(\mathbb{T}\)-gain graphs via partial transpose (Q6604503) (← links)
