✦ LIBER ✦

Spanning trees and identifiability of a single-factor model

✍ Scribed by Claudia Tarantola; Paola Vicard

Book ID: 110544302
Publisher: Springer
Year: 2002
Tongue: English
Weight: 600 KB
Volume: 11
Category: Article
ISSN: 1613-981X
DOI: 10.1007/bf02511482

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Spanning trees and a conjecture of Konts

Spanning trees and a conjecture of Kontsevich

✍ Richard P. Stanley 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 730 KB

Unranking and ranking spanning trees of

Unranking and ranking spanning trees of a graph

✍ Charles J Colbourn; Robert P.J Day; Louis D Nel 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 845 KB

Modelling properties of spanning trees:

Modelling properties of spanning trees: Diameter and distance sum

✍ Michael J. Plantholt 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 313 KB

Identifiability and identification of a

Identifiability and identification of a Synthesis Load Model

✍ Ping Ju; YuQing Jin; Qian Chen; ZhengYan Shao; Chao Mao 📂 Article 📅 2010 🏛 SP Science China Press 🌐 English ⚖ 616 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

Graphs with an extremal number of spanni

Graphs with an extremal number of spanning trees

✍ A. K. Kelmans 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB 👁 1 views