𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Combinatorial Properties of a Rooted Graph Polynomial

✍ Scribed by Eisenstat, David; Gordon, Gary; Redlich, Amanda

Book ID
118196946
Publisher
Society for Industrial and Applied Mathematics
Year
2008
Tongue
English
Weight
172 KB
Volume
22
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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