✦ LIBER ✦

On the number of spanning trees and Eulerian tours in iterated line digraphs

✍ Scribed by Zhang Huaxiao; Zhang Fuji; Huang Qiongxiang

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 448 KB
Volume: 73
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(95)00118-b

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the numbers of spanning trees and Eul

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

✍ Xueliang Li; Fuji Zhang 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 756 KB

The number of spanning trees in buckmins

The number of spanning trees in buckminsterfullerene

✍ T. J. N. Brown; R. B. Mallion; P. Pollak; Branca R. M. de Castro; J. A. N. F. Go 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 662 KB

## Abstract The theorem of Gutman et al. (1983) is applied to calculate the number of spanning trees in the carbon‐carbon connectivity‐network of the recently diagnosed C~60~‐cluster buckminsterfullerene. This “complexity” turns out to be approximately 3.75 × 10^20^ and it is found necessary to inv

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 graphs with the maximum number of spa

On graphs with the maximum number of spanning trees

✍ Alexander K. Kelmans 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 814 KB

Let 3:; denote the set of simple graphs with n vertices and m edges, t ( G ) the number of spanning trees of a graph G , and F 2 H if t(K,\E(F))?t(K,\E(H)) for every s? max{u(F), u ( H ) } . We give a complete characterization of >-maximal (maximum) graphs in 3:; subject to m 5 n . This result conta

On the number of spanning trees of Kn an

On the number of spanning trees of Kn and Km, n

✍ Moh'd Z. Abu-Sbeih 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 170 KB

The object of this paper is to introduce a new technique for showing that the number of labelled spanning trees of the complete bipartite graph K,,,, is IT(m, n)l = m"-'n"-'. As an application, we use this technique to give a new proof of Cayley's formula IT(n)1 = nnm2, for the number of labelled s