✦ LIBER ✦

Counting spanning trees in directed regular multigraphs

✍ Scribed by Jacek M. Wojciechowski; Michael Fellows

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 484 KB
Volume: 326
Category: Article
ISSN: 0016-0032
DOI: 10.1016/0016-0032(89)90011-2

No coin nor oath required. For personal study only.

✦ Synopsis

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 trees with the use of graph eigencalues is introduced. Formulue,fi,r computing eigemalues of Cayley multigruphs are presented.

📜 SIMILAR VOLUMES

Counting Spanning Trees in Cographs

✍ Stavros D. Nikolopoulos; Charis Papadopoulos 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 485 KB

On the number of spanning trees in direc

On the number of spanning trees in directed circulant graphs

✍ Zbigniew Lonc; Krzysztof Parol; Jacek M. Wojciechowski 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 117 KB

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.

Counting the number of spanning trees in

Counting the number of spanning trees in a class of double fixed-step loop networks

✍ Talip Atajan; Naohisa Otsuka; Xuerong Yong 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 495 KB

A double fixed-step loop network, C p,q n , is a digraph on n vertices 0, 1, 2, . . . , n -1 and for each vertex i (0 < i ≤ n-1), there are exactly two arcs going from vertex i to vertices i+p, i + q (mod n). Let p < q < n be positive integers such that (qp) Ď n and (qp)|(k 0 np) or (qp)|n (where k

The degree-preserving spanning tree prob

The degree-preserving spanning tree problem in strongly chordal and directed path graphs

✍ Ching-Chi Lin; Gerard J. Chang; Gen-Huey Chen 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 108 KB

## Abstract Suppose __G__ is a connected graph and __T__ a spanning tree of __G__. A vertex __v__ ε __V__(__G__) is said to be a degree‐preserving vertex if its degree in __T__ is the same as its degree in __G__. The degree‐preserving spanning tree problem is to find a spanning tree __T__ of a conn

Some methods for counting the spanning t

Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes [Discrete Applied Mathematics 67 (1996) 51–66]

✍ T.J.N. Browna; R.B. Mallion; P. Pollak; A. Roth 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 81 KB

To recast Eq. ( ), we obtain from the same identity the relations Yij = Xj, j = 1,2, . . . , n, ' Now at St. John's College, Oxford.