✦ LIBER ✦

On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs

✍ Scribed by Xueliang Li; Fuji Zhang

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 756 KB
Volume: 94
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90024-v

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

On the number of spanning trees in a mol

On the number of spanning trees in a molecular graph

✍ R.B. Mallion 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 444 KB

A rccenl theorem due to W'aller is applied to the mokculnr gmph of a typical conjugtcd system (naphthalene) in order to demonstrate the enumeration of spanning trees, on each of which a "ring current" calculation may be based.

On the asymptotic behavior of the maximu

On the asymptotic behavior of the maximum number of spanning trees in circulant graphs

✍ Lonc, Zbigniew; Parol, Krzysztof; Wojciechowski, Jacek M. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB 👁 3 views

The following asymptotic estimation of the maximum number of spanning trees f k (n) in 2kregular circulant graphs ( k ú 1) on n vertices is the main result of this paper: )) , where

On numbers of vertices of maximum degree

On numbers of vertices of maximum degree in the spanning trees of a graph

✍ Jerzy Topp; Preben D. Vestergaard 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 611 KB

For a connected graph G, let ~-(G) be the set of all spanning trees of G and let nd(G) be the number of vertices of maximum degree in G. In this paper we show that if G is a cactus or a connected graph with p vertices and p+ 1 edges, then the set {na(T) : T C ~-(G)) has at most one gap, that is, it

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.

On the number of cycles of short length

On the number of cycles of short length in the DE Bruijn-good graph Gn

✍ Zhe-xian Wan; Rong-hua Xiong; Min-an Yu 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 865 KB

An algebraic approach to enumerate the number of cycles of short length in the de Bruijn-Good graph Gn is given and the following theorem is proved. where ~)k,m--1 is defined to be the number of positive integers l <<-k satisfying (k, l) <<-m -1, l~(q) is the M6bius function, dt = (k, l), e~ = 0 or