Generating formulas for the number of trees in a graph

DOI10.1016/0016-0032(64)90448-XzbMATH Open0135.41904OpenAlexW2023012626MaRDI QIDQ2521176FDOQ2521176

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

Cites Work

• The number of trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A NOTE ON THE ENUMERATION AND LISTING OF ALL POSSIBLE TREES IN A CONNECTED LINEAR GRAPH
• The Fibonacci numbers via trigonometric expressions
• Formulas for the number of trees in certain incomplete graphs
• Title not available (Why is that?)
• On trees of a graph and their generation
• Enumeration of spanning trees containing given subgraphs
• Title not available (Why is that?)

Cited In (11)

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

This page was built for publication: Generating formulas for the number of trees in a graph

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