DocumentCode :
1192580
Title :
An approximate formula for counting trees in a graph
Author :
Wojciechowski, Jacek M.
Volume :
32
Issue :
4
fYear :
1985
fDate :
4/1/1985 12:00:00 AM
Firstpage :
382
Lastpage :
385
Abstract :
In the paper, an approximate formula for counting trees in a graph is presented. The formula estimates the change in the number of trees of a reference graph after adding or removing a certain number of lines to obtain a graph with the same number of lines as the graph considered. It is assumed that the reference graph and the graph analyzed have the same number of points. It is also assumed that the number of trees of a reference graph changes with a change in the number of lines identically as in a uniform graph. Special classes of reference graphs are discussed and formulas for counting trees are given.
Keywords :
General analysis and synthesis methods; Trees; Eigenvalues and eigenfunctions; Moon; Polynomials; Terminology; Tree graphs;
fLanguage :
English
Journal_Title :
Circuits and Systems, IEEE Transactions on
Publisher :
ieee
ISSN :
0098-4094
Type :
jour
DOI :
10.1109/TCS.1985.1085721
Filename :
1085721
Link To Document :
بازگشت