Indirect counting trees in linear graphs

DOI10.1016/0016-0032(71)90013-5zbMath0253.05103OpenAlexW2089310087MaRDI QIDQ2557701

Guido O. Guardabassi

Publication date: 1971

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

Full work available at URL: https://doi.org/10.1016/0016-0032(71)90013-5

Mathematics Subject Classification ID

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

Related Items (1)

Counting patterns in graphs

Cites Work

• Generating formulas for the number of trees in a graph
• The identification of an incompletely partitioned network
• Counting Paths, Circuits, Chains, and Cycles in Graphs: a Unified Approach
• Unnamed Item
• Unnamed Item

This page was built for publication: Indirect counting trees in linear graphs