On the number of spanning trees of multi-star related graphs

Information Processing Letters

Volumn 65, Issue 4, 1998, Pages 183-188

  Nikolopoulos, S D ^a   Rondogiannis, P ^a  

^a UNIVERSITY OF IOANNINA   (Greece)

Author keywords

Combinatorial problems; Complement spanning tree matrix theorem; Interconnection networks; Multi star graphs; Spanning trees

Indexed keywords

COMBINATORIAL MATHEMATICS; GRAPH THEORY; INTERCONNECTION NETWORKS; LINEAR ALGEBRA; MATRIX ALGEBRA; SET THEORY;

COMPLEMENT SPANNING TREE MATRIX THEOREM; MULTI STAR GRAPHS;

TREES (MATHEMATICS);

EID: 0032002349     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00008-8     Document Type: Article

References (9)

1. C. Berge, Graphs and Hypergraphs, North-Holland, Amsterdam, 1973.
2. F.T. Boesch, On unreliability polynomials and graph connectivity in reliable network synthesis, J. Graph Theory 10 (1986) 339-352.
3. F. Buckley, F. Harary, Distance in Graphs, Addison-Wesley, Reading, MA, 1990.
4. Xiaoming Li, On the synthesis of reliable networks, Ph.D Thesis, Stevens Institute of Technology, 1987
5. W. Moon, Enumerating labelled trees, in: F. Harary, Graph Theory and Theoretical Physics, Academic Press, London, 1967, pp. 261-271.
6. W. Myrvold, Uniformly-most reliable graphs do not always exist, Tech. Rept., Dept. of Computer Science, University of Victoria, 1989.
7. P.V. O'Neil, The number of trees in a certain network, Notices Amer. Math. Soc. 10 (1963) 569.
8. H.N.V. Temperley, On the mutual cancellation of cluster integrals in Mayer's fugacity series. Proc. Phys Soc. 83 (1964) 3-16.
9. L. Weinberg, Number of trees in a graph, Proc. IRE 46 (1958) 1954-1955.