Generating formulas for the number of trees in a graph

S.D. Bedrosian

Type: Article

Publication Date: 1964-04-01

Citations: 27

DOI: https://doi.org/10.1016/0016-0032(64)90448-x

View Publication

Locations

Journal of the Franklin Institute - View

Similar Works

Action	Title	Year	Authors
+	Formulas for the Number of Trees in a Graph	1969	M. Bercovici
+	Formulas for the Number of Trees in a Network	1961	S.D. Bedrosian
+	Generating functions and counting formulas for spanning trees and forests in hypergraphs	2024	Jiuqiang Liu Shenggui Zhang Guihai Yu
+	Formulas for the number of trees in certain incomplete graphs	1970	S.D. Bedrosian
+	Cayley’s formula for the number of trees	2004	Martin Aigner Günter M. Ziegler
+	Cayley’s formula for the number of trees	2018	Martin Aigner Günter M. Ziegler
+	Cayley’s formula for the number of trees	2014	Martin Aigner Günter M. Ziegler
+	Cayley’s formula for the number of trees	2001	Martin Aigner Günter M. Ziegler
+	Cayley’s formula for the number of trees	2009	Martin Aigner Günter M. Ziegler
+ PDF Chat	Generating functions for generating trees	2002	Cyril Banderier Philippe Flajolet Danièle Gardy Mireille Bousquet‐Mélou Alain Denise Dominique Gouyou-Beauchamps
+ PDF Chat	Generating functions for generating trees	2002	Cyril Banderier Mireille Bousquet‐Mélou Alain Denise Philippe Flajolet Danièle Gardy Dominique Gouyou-Beauchamps
+ PDF Chat	Complexity Results for Generating Subgraphs	2017	Vadim E. Levit David Tankus
+	Generating formulas of the number of spanning trees of some special graphs	2014	S. N. Daoud
+ PDF Chat	Counting trees in a graph	2018	Anton Petrunin
+	Counting trees in a graph is #P-complete	1994	Mark Jerrum
+	Enumeration of Trees	1963	O. Wing
+	Treewidth of Graphs	2014	Hans L. Bodlaender
+	Treewidth of Graphs	2016	Hans L. Bodlaender
+	Treewidth of Graphs	2008	Hans L. Bodlaender
+	Principles of enumeration of the number of graphs	1968	A. E. Yurtsun

Works That Cite This (20)

Action	Title	Year	Authors
+	On the independent set sequence of a tree.	2020	Abdul Basit David Galvin
+	Chebyshev polynomials and spanning tree formulas for circulant and related graphs	2005	Yuanping Zhang Xuerong Yong Mordecai J. Golin
+	Formulas for the number of multitrees in a complete graph	1967	Ken A. Brown
+	Number of Trees in a Chain of Identical Graphs	1966	Walerian Gruszczyński
+	A Bijective Proof For Forest Reciprocity Theorem	2009	ShinnYih Huang
+	On topological approaches to network theory	1965	Y.H. Ku S.D. Bedrosian
+	Enumeration of spanning trees in certain graphs	1970	Peter V. O'Neil
+	Formulas for the number of trees in certain incomplete graphs	1970	S.D. Bedrosian
+	On generic forms of complementary graphs	1983	J. W. Moon S.D. Bedrosian
+	On enumerating paths of K arcs in unoriented complete graphs	1975	Eugene Rawdin S.D. Bedrosian

Works Cited by This (6)

Action	Title	Year	Authors
+	Linear graphs and electrical networks	1961	S. Seshu Myril B. Reed
+	Résumé of Maxwell's and Kirchhoff's rules for network analysis	1952	Y.H. Ku
+	Formulas for the Number of Trees in a Network	1961	S.D. Bedrosian
+ PDF Chat	On Evaluation of the Graph Trees and the Driving Point Admittance	1958	Nobuo Nakagawa
+	An Introduction to Combinatorial Analysis	1958	R. A. Leibler John Riordan
+	An Introduction to Combinatorial Analysis	1959	L. Schmetterer J. Riordan