Formulas for the number of trees in certain incomplete graphs

DOI10.1016/0016-0032(70)90261-9zbMath0297.05125OpenAlexW2062491580MaRDI QIDQ1213886

Samuel D. Bedrosian

Publication date: 1970

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

Full work available at URL: https://doi.org/10.1016/0016-0032(70)90261-9

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

Related Items (5)

A certain polynomial of a graph and graphs with an extremal number of trees ⋮ The Fibonacci numbers via trigonometric expressions ⋮ Generating formulas for the number of trees in a graph ⋮ Chebyshev polynomials and spanning tree formulas for circulant and related graphs ⋮ Generalized m series in tree enumeration

Cites Work

• Generating formulas for the number of trees in a graph
• The identification of an incompletely partitioned network
• Unnamed Item

This page was built for publication: Formulas for the number of trees in certain incomplete graphs