Generating formulas for the number of trees in a graph

DOI10.1016/0016-0032(64)90448-XzbMath0135.41904OpenAlexW2023012626MaRDI QIDQ2521176

Samuel D. Bedrosian

Publication date: 1964

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0016-0032(64)90448-x

zbMATH Keywords

topology

Related Items

A certain polynomial of a graph and graphs with an extremal number of trees, Finding the graph with the maximum number of spanning trees, Tree counting polynomials for labelled graphs. I: Properties, Formulas for the number of trees in certain incomplete graphs, The Fibonacci numbers via trigonometric expressions, On enumerating paths of K arcs in unoriented complete graphs, On topological approaches to network theory, On the independent set sequence of a tree, Indirect counting trees in linear graphs, Chebyshev polynomials and spanning tree formulas for circulant and related graphs, On generic forms of complementary graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Formulas for the number of trees in certain incomplete graphs
• The Fibonacci numbers via trigonometric expressions
• On trees of a graph and their generation
• Enumeration of spanning trees containing given subgraphs
• The number of trees
• A NOTE ON THE ENUMERATION AND LISTING OF ALL POSSIBLE TREES IN A CONNECTED LINEAR GRAPH