✦ LIBER ✦

The Cyclomatic Number of a Graph and its Independence Polynomial at −1

✍ Scribed by Vadim E. Levit, Eugen Mandrescu

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An upper bound on the independence numbe

✍ Carlos J. Luz 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 450 KB

The Domination Polynomial of a Graph at

✍ Saeid Alikhani 📂 Article 📅 2012 🏛 Springer Japan 🌐 English ⚖ 168 KB

Transformations of a Graph Increasing it

✍ A.K. Kelmans 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 310 KB

The product of the independent dominatio

✍ E.J. Cockayne; O. Favaron; H. Li; G. MacGillivray 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 240 KB

The Shannon capacity of a graph and the

✍ Alon, N.; Lubetzky, E. 📂 Article 📅 2006 🏛 IEEE 🌐 English ⚖ 235 KB

A bound on the values of independence po

✍ Estes, John; Staton, William; Wei, Bing 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 386 KB