Pages that link to "Item:Q5827586"

The following pages link to A NOTE ON THE ENUMERATION AND LISTING OF ALL POSSIBLE TREES IN A CONNECTED LINEAR GRAPH (Q5827586):

Displaying 17 items.

• A generalization to bases common to r binary matroids of the weighted matrix-tree theorem in the case when the weights are Boolean (Q800365) (← links)
• The number of minimally connected block designs (Q1082758) (← links)
• Matchings and spanning trees in boolean weighted graphs (Q1153928) (← links)
• A generalization of the matrix-tree theorem (Q1160631) (← links)
• Matrix tree theorems (Q1245845) (← links)
• Laplacian matrices of graphs: A survey (Q1319985) (← links)
• A certain polynomial of a graph and graphs with an extremal number of trees (Q1393403) (← links)
• An evolutionary approach for finding optimal trees in undirected networks (Q1579498) (← links)
• Enumerative combinatorics of simplicial and cell complexes: Kirchhoff and Trent type theorems (Q1739195) (← links)
• Generalized m series in tree enumeration (Q1843449) (← links)
• Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes (Q1917322) (← links)
• Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs (Q1987232) (← links)
• Divide-and-conquer based all spanning tree generation algorithm of a simple connected graph (Q2062131) (← links)
• Generating formulas for the number of trees in a graph (Q2521176) (← links)
• On trees of a graph and their generation (Q2521783) (← links)
• Algebraic reduction of electrical multiterminal networks (Q2530001) (← links)
• The permanent of the Laplacian matrix of a bipartite graph (Q3739149) (← links)