✦ LIBER ✦

Roots of Independence Polynomials of Well Covered Graphs

✍ Scribed by J.I. Brown; K. Dilcher; R.J. Nowakowski

Book ID: 110266564
Publisher: Springer
Year: 2000
Tongue: English
Weight: 73 KB
Volume: 11
Category: Article
ISSN: 0925-9899
DOI: 10.1023/a:1008705614290

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the roots of independence polynomials

On the roots of independence polynomials of almost all very well-covered graphs

✍ Vadim E. Levit; Eugen Mandrescu 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 253 KB

Building Graphs Whose Independence Polyn

Building Graphs Whose Independence Polynomials Have Only Real Roots

✍ Eugen Mandrescu 📂 Article 📅 2009 🏛 Springer Japan 🌐 English ⚖ 209 KB

Independence Sequences of Well-Covered G

Independence Sequences of Well-Covered Graphs: Non-Unimodality and the Roller-Coaster Conjecture

✍ T.S. Michael; William N. Traves 📂 Article 📅 2003 🏛 Springer Japan 🌐 English ⚖ 283 KB

Independence polynomials of k-tree relat

Independence polynomials of k-tree related graphs

✍ Lanzhen Song; William Staton; Bing Wei 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 292 KB

On the Location of Roots of Independence

On the Location of Roots of Independence Polynomials

✍ J.I. Brown; C.A. Hickman; R.J. Nowakowski 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 88 KB

Roots of cube polynomials of median grap

Roots of cube polynomials of median graphs

✍ Boštjan Brešar; Sandi Klavžar; Riste Škrekovski 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB

## Abstract The cube polynomial __c__(__G__,__x__) of a graph __G__ is defined as $\sum\nolimits\_{i \ge 0} {\alpha \_i ( G)x^i }$, where α~i~(__G__) denotes the number of induced __i__‐cubes of __G__, in particular, α~0~(__G__) = |__V__(__G__)| and α~1~(__G__) = |__E__(__G__)|. Let __G__ be a medi