The following pages link to On $W$-bases of directed graphs (Q3252408):
Displaying 14 items.
- On coefficients of the characteristic polynomial of the Laplace matrix of a weighted digraph and the all minors theorem (Q291166) (← links)
- A recursive algorithm for trees and forests (Q507491) (← links)
- On the number of spanning trees of \(K_ n\) and \(K_{m,n}\) (Q912860) (← links)
- Which digraphs with ring structure are essentially cyclic? (Q984026) (← links)
- Laplacian matrices of graphs: A survey (Q1319985) (← links)
- On the characteristic polynomial and eigenvectors in terms of the tree-like structure of a digraph (Q1661494) (← links)
- On the spectra of nonsymmetric Laplacian matrices (Q1772727) (← links)
- Forest matrices around the Laplacian matrix (Q1855402) (← links)
- Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes (Q1917322) (← links)
- Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs (Q2192108) (← links)
- Simplicial matrix-tree theorems (Q3642704) (← links)
- On the properties of orthogonal projection method for reaching consensus (Q6078061) (← links)
- Counting spanning trees in a complete bipartite graph which contain a given spanning forest (Q6081889) (← links)
- On two conjectures concerning spanning tree edge dependences of graphs (Q6180563) (← links)
