𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Independence polynomials of k-tree related graphs

✍ Scribed by Lanzhen Song; William Staton; Bing Wei

Book ID
108112860
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
292 KB
Volume
158
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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.

Circumferences of k-connected graphs inv
Circumferences of k-connected graphs involving independence numbers
✍ Guantao Chen; Zhiquan Hu; Yaping Wu πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 211 KB πŸ‘ 1 views

Let G be a k-connected graph of order n, := (G) the independence number of G, and c(G) the circumference of G. ChvΓ‘tal and Erdo ˝s proved that if ≀ k then G is hamiltonian. For β‰₯ k β‰₯ 2, Fouquet and Jolivet in 1978 made the conjecture that c(G) β‰₯ k(n+ -k) / . Fournier proved that the conjecture is tr