The following pages link to (Q3405282):
Displaying 8 items.
- Combinatorial approach for computing the characteristic polynomial of a matrix (Q710864) (← links)
- On the characteristic polynomial and eigenvectors in terms of the tree-like structure of a digraph (Q1661494) (← links)
- A combinatorial method for computing characteristic polynomials of starlike hypergraphs (Q2187747) (← links)
- A method to calculate the characteristic polynomials of a graph on \(n\) vertices by the aid of a computer (Q2858617) (← links)
- A graph theoretical recurrence formula for computing the characteristic polynomial of matrix (Q3971818) (← links)
- On the graph polynomials of a weighted graph (Q3978339) (← links)
- (Q5060665) (← links)
- CHARACTERISTIC POLYNOMIAL OF ADJACENCY OR LAPLACIAN MATRIX FOR WEIGHTED TREELIKE NETWORKS (Q5108063) (← links)
