✦ LIBER ✦

Independence polynomials of some compound graphs

✍ Scribed by Lanzhen Song; William Staton; Bing Wei

Book ID: 113564736
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 223 KB
Volume: 160
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.11.012

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Mehler formulae for matching polynomials

Mehler formulae for matching polynomials of graphs and independence polynomials of clawfree graphs

✍ Bodo Lass 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 190 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

Roots of Independence Polynomials of Wel

Roots of Independence Polynomials of Well Covered Graphs

✍ J.I. Brown; K. Dilcher; R.J. Nowakowski 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 73 KB

Clique polynomials and independent set p

Clique polynomials and independent set polynomials of graphs

✍ Cornelis Hoede; Xueliang Li 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 492 KB

This paper introduces two kinds of graph polynomials, clique polynomial and independent set polynomial. The paper focuses on expansions of these polynomials. Some open problems are mentioned.

Building Graphs Whose Independence Polyn

Building Graphs Whose Independence Polynomials Have Only Real Roots

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

Some New Large Compound Graphs

✍ C. Delorme; J. Gómez 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 111 KB

This paper deals with some new constructions of large ( , D) graphs, i.e., graphs with maximum degree and diameter D and many vertices. Most constructions presented here are based on the compound graphs technique. The basic idea of compound graphs consists of connecting together several copies of a