𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generalized -graphs for nonzero roots of the matching polynomial

✍ Scribed by Cheng Yeaw Ku; Kok Bin Wong

Book ID
113567373
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
314 KB
Volume
311
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Computational algorithms for matching po
Computational algorithms for matching polynomials of graphs from the characteristic polynomials of edge-weighted graphs
✍ Haruo Hosoya; K. Balasubramanian πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 736 KB

Computational algorithms are described which provide for constructing the set of associated edgeweighted directed graphs such that the average of the characteristic polynomials of the edge-weighted graphs gives the matching polynomial of the parent graph. The weights were chosen to be unities or pur

On the greedoid polynomial for rooted gr
On the greedoid polynomial for rooted graphs and rooted digraphs
✍ Elizabeth W. McMahon πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 499 KB

## Abstract We examine some properties of the 2‐variable greedoid polynomial __f__(__GΒ·,t,z__) when __G__ is the branching greedoid associated to a rooted graph or a rooted directed graph. For rooted digraphs, we show a factoring property of __f__(__GΒ·,t,z__) determines whether or not the rooted di