✦ LIBER ✦

Closed formulas for the number of small paths, independent sets and matchings in fullerenes

✍ Scribed by A. Behmaram; H. Yousefi-Azari; A.R. Ashrafi

Book ID: 116217565
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 220 KB
Volume: 25
Category: Article
ISSN: 0893-9659
DOI: 10.1016/j.aml.2012.01.045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Closed formulas for the numbers of small

Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees

✍ Charles Delorme; Odile Favaron; Dieter Rautenbach 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 192 KB

We derive closed formulas for the numbers of independent sets of size at most 4 and matchings of size at most 3 in graphs without small cycles that depend only on the degree sequence and the products of the degrees of adjacent vertices. As a related problem we describe an algorithm that determines

The Number of Maximal Independent Sets i

The Number of Maximal Independent Sets in a Tree

✍ Wilf, Herbert S. 📂 Article 📅 1986 🏛 Society for Industrial and Applied Mathematics ⚖ 451 KB

Bounds for the matching number, the edge

Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank

✍ Wang, Long; Wong, Dein 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 372 KB