𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Chain polynomials of graphs

✍ Scribed by Ronald C. Read

Book ID
108315812
Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
221 KB
Volume
265
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Polynomials on graphs
Polynomials on graphs
✍ Paul M. Weichsel πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 462 KB

Let G be a simple graph with adjacency matrix A, and p(x) a polynomial with rational coefficients. If p(A) is the adjacency matrix of a graph, we denote that graph by p(G). We consider the question: Given a graph 6, which polynomials p(r) give rise to a graph p(G) and what are those graphs? We give

Permanental polynomials of graphs
Permanental polynomials of graphs
✍ Russell Merris; Kenneth R. Rebman; William Watkins πŸ“‚ Article πŸ“… 1981 πŸ› Elsevier Science 🌐 English βš– 819 KB
Imminant polynomials of graphs
Imminant polynomials of graphs
✍ K. Balasubramanian πŸ“‚ Article πŸ“… 1993 πŸ› Springer 🌐 English βš– 537 KB
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