✦ LIBER ✦

Imminant polynomials of graphs

✍ Scribed by K. Balasubramanian

Book ID: 105077074
Publisher: Springer
Year: 1993
Tongue: English
Weight: 537 KB
Volume: 85
Category: Article
ISSN: 1432-2234
DOI: 10.1007/bf01113431

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Chain polynomials of graphs

✍ Ronald C. Read 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 221 KB

Permanental polynomials of graphs

✍ Russell Merris; Kenneth R. Rebman; William Watkins 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 819 KB

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

Mehler formulae for matching polynomials

Mehler formulae for matching polynomials of graphs and independence polynomials of clawfree graphs

✍ Bodo Lass 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 190 KB

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.