Formulas for the number of trees in certain incomplete graphs

DOI10.1016/0016-0032(70)90261-9MaRDI QIDQ1213886zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3324508 (Why is no real title available?)
• Generating formulas for the number of trees in a graph
• The identification of an incompletely partitioned network

Cited in

(6)

• Generating formulas for the number of trees in a graph
• Chebyshev polynomials and spanning tree formulas for circulant and related graphs
• The Fibonacci numbers via trigonometric expressions
• A certain polynomial of a graph and graphs with an extremal number of trees
• The number of spanning trees in \(K_n\)-complement of a bipartite graph
• Generalized m series in tree enumeration

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1213886)