𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Permanental polynomials of graphs

✍ Scribed by Russell Merris; Kenneth R. Rebman; William Watkins

Publisher
Elsevier Science
Year
1981
Tongue
English
Weight
819 KB
Volume
38
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Tension polynomials of graphs
Tension polynomials of graphs
✍ Martin Kochol πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 104 KB

The tension polynomial F G (k) of a graph G, evaluating the number of nowhere-zero Z k -tensions in G, is the nontrivial divisor of the chromatic polynomial G (k) of G, in that G (k) ΒΌ k c(G) F G (k), where c(G) denotes the number of components of G. We introduce the integral tension polynomial I G

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.

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