A NOTE ON THE ENUMERATION AND LISTING OF ALL POSSIBLE TREES IN A CONNECTED LINEAR GRAPH
From MaRDI portal
Publication:5827586
DOI10.1073/pnas.40.10.1004zbMath0055.42204OpenAlexW2061116853WikidataQ37687702 ScholiaQ37687702MaRDI QIDQ5827586
Publication date: 1954
Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1073/pnas.40.10.1004
Related Items
The number of minimally connected block designs, Bicycles and Spanning Trees, On Connectedness and Trees of an N-graph, Principal subpermanents of the Laplacian matrix, Connectivity of finite anisotropic random graphs and directed graphs, Graph property recognition machines, Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes, A certain polynomial of a graph and graphs with an extremal number of trees, Matchings and spanning trees in boolean weighted graphs, A generalization of the matrix-tree theorem, Enumerative combinatorics of simplicial and cell complexes: Kirchhoff and Trent type theorems, Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs, Matrix tree theorems, Generating formulas for the number of trees in a graph, On trees of a graph and their generation, Algebraic reduction of electrical multiterminal networks, Divide-and-conquer based all spanning tree generation algorithm of a simple connected graph, An evolutionary approach for finding optimal trees in undirected networks, The permanent of the Laplacian matrix of a bipartite graph, A Proof of Tuite’s Trinity Theorem and a New Determinant Formula, Generalized m series in tree enumeration, A generalization to bases common to r binary matroids of the weighted matrix-tree theorem in the case when the weights are Boolean, Laplacian matrices of graphs: A survey
