✦ LIBER ✦

Indirect counting tress in linear graphs

✍ Scribed by Guido Guardabassi

Book ID: 103084962
Publisher: Elsevier Science
Year: 1971
Tongue: English
Weight: 465 KB
Volume: 291
Category: Article
ISSN: 0016-0032
DOI: 10.1016/0016-0032(71)90013-5

No coin nor oath required. For personal study only.

✦ Synopsis

The problem of counting spanning trees in linear graphs is dealt with. A quite general indirect approach, based on the analysis of the complementary graph, is followed and a new counting formula, which applies to any kind of linear non-oriented graph, is given. The paper ends with some comments and concluding remarks.

📜 SIMILAR VOLUMES

Counting patterns in graphs

✍ Guido Guardabassi 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 326 KB

Counting Matchings in Graphs

✍ E.J. Farrell 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 488 KB

A general formula is derivedfor the matching polynomial of an arbitrary graph G. This yields a methodfor counting matchings in graphs. From the general formula, explicit formulae are deducedfor the number of k-matchings in several well-known families of graphs.

Counting 1-factors in infinite graphs

✍ Ron Aharoni; Mao Lin Zheng 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 627 KB

Counting 1-Factors in Regular Bipartite

Counting 1-Factors in Regular Bipartite Graphs

✍ Alexander Schrijver 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 325 KB

We show that any k-regular bipartite graph with 2n vertices has at least \ (k&1) k&1 k k&2 + n perfect matchings (1-factors). Equivalently, this is a lower bound on the permanent of any nonnegative integer n\_n matrix with each row and column sum equal to k. For any k, the base (k&1) k&1 Âk k&2 is l

On Counting Independent Sets in Sparse G

On Counting Independent Sets in Sparse Graphs

✍ Dyer, Martin; Frieze, Alan; Jerrum, Mark 📂 Article 📅 2002 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 194 KB

Counting odd cycles in locally dense gra

Counting odd cycles in locally dense graphs

✍ Reiher, Christian 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 204 KB