The following pages link to Interlacing–extremal graphs (Q5415706):
Displaying 10 items.
- On the inverse of the adjacency matrix of a graph (Q2017188) (← links)
- Edge construction of molecular NSSDs (Q2026330) (← links)
- On the displacement of eigenvalues when removing a twin vertex (Q2295997) (← links)
- The increase in the resolvent energy of a graph due to the addition of a new edge (Q2423029) (← links)
- Coalescing Fiedler and core vertices (Q2828829) (← links)
- Spectra and structural polynomials of graphs of relevance to the theory of molecular conduction (Q4604528) (← links)
- Triangles in inverse NSSD graphs (Q5206294) (← links)
- The conductivity of superimposed key-graphs with a common one-dimensional adjacency nullspace (Q5225029) (← links)
- Non-singular graphs with a singular deck (Q5962515) (← links)
- Reconstruction from one labelled card and more (Q6536720) (← links)
