Pages that link to "Item:Q3204505"

The following pages link to A deletion-contraction algorithm for the characteristic polynomial of a multigraph (Q3204505):

Displaying 9 items.

• Combinatorial approach for computing the characteristic polynomial of a matrix (Q710864) (← links)
• A survey of automated conjectures in spectral graph theory (Q962119) (← links)
• On Hamiltonian graphs with maximal index (Q1123901) (← links)
• A characterization of oriented hypergraphic Laplacian and adjacency matrix coefficients (Q1669013) (← links)
• The characteristic polynomials of modified graphs (Q1917341) (← links)
• The first few unicyclic and bicyclic hypergraphs with largest spectral radii (Q2359562) (← links)
• A study of eigenspaces of graphs (Q2365658) (← links)
• On the index of tricyclic Hamiltonian graphs (Q3820632) (← links)
• The largest eigenvalue of a graph: A survey (Q4713877) (← links)