✦ LIBER ✦

Counting Spanning Trees in Cographs

✍ Scribed by Stavros D. Nikolopoulos; Charis Papadopoulos

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 485 KB
Volume: 13
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(04)00445-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Counting Minimum Weight Spanning Trees

✍ Andrei Z. Broder; Ernst W. Mayr 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 152 KB

We present an algorithm for counting the number of minimum weight spanning trees, based on the fact that the generating function for the number of spanning trees of a given graph, by weight, can be expressed as a simple determinant. For a graph with n vertices and m edges, our Ž Ž .. Ž . algorithm r

Counting spanning trees in directed regu

Counting spanning trees in directed regular multigraphs

✍ Jacek M. Wojciechowski; Michael Fellows 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 484 KB

The problem of counting spunning trees in regular multigraphs is considered. The emphasis is on the case of directed trees. It is shown that the numbers qf spanning intrees and out-trees with respect to any point of' a regular multigraph are the same. A general .formulafor counting directed spunning

Ends in spanning trees

✍ Xingxing Yu 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 97 KB

We refer to for terminology not specified here. Graphs mentioned in this note are undirected, simple. The following definition is due to Halin [l]: an end E of an infinite graph G is a set of l-way infinite paths in G such that P, Q E E iff for any finite subset R of V(G) there is a finite path in

Counting spanning trees in the graphs of

Counting spanning trees in the graphs of Kleitman and Golden and a generalization

✍ R. Vohra; L. Washington 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 302 KB

A new calculation is given for the number of spanning trees in a family of labellec; graphs considered by Kleitman and Golden, and for a more general class of such graphs.

Spanning trees in a cactus

✍ Y. Egawa; Preben Dahl Vestergaard 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 361 KB

Leafy spanning trees in hypercubes

✍ W. Duckworth; P.E. Dunne; A.M. Gibbons; M. Zito 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 214 KB

We prove that the d-dimensional hypercube, Qd, with n ----2 d vertices, contains a spanning tree with at least 1 log 2 n o n -t-2 leaves. This improves upon the bound implied by a more general result on spanning trees in graphs with minimum degree 5, which gives (1 -O(loglogn)/log 2 n)n as a lower b