A formula for the number of spanning trees of a multi-star related graph

Information Processing Letters

Volumn 68, Issue 6, 1998, Pages 295-298

  Yan, Wen Ming ^a   Myrvold, Wendy ^b   Chung, Kuo Liang ^c  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^b UNIVERSITY OF VICTORIA   (Canada)

^c NATIONAL TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

Combinatorial problems; Multi star graph; Spanning trees

Indexed keywords

MATRIX ALGEBRA; PROBLEM SOLVING;

MULTI-STAR GRAPH; SPANNING TREES;

TREES (MATHEMATICS);

EID: 0032309324     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00175-6     Document Type: Article

References (5)

1. C. Berge, Graphs and Hypergraphs, North-Holland, Amsterdam, 1973.
2. W. Moon, Enumerating labeled trees, in: F. Harary (Ed.), Graph Theory and Theoretical Physics, Academic Press, London, 1967, pp. 261-271.
3. S.D. Nikolopoulos, P. Rondogiannis, On the number of spanning trees of multi-star related graphs, Inform. Process. Lett. 65 (1998) 183-188.
4. P.V. O'Neil, The number of trees in a certain network, Notices Amer. Math. Soc. 10 (1963) 569.
5. H.N.V. Temperley, On the mutual cancellation of cluster integrals in Mayer's fugacity series, Proc. Phys. Soc. 83 (1964) 3-16.