✦ LIBER ✦

ChemInform Abstract: Polynomials and Spectra of Molecular Graphs

✍ Scribed by Ovidiu Ivanciuc; Teodora Ivanciuc; Mircea V. Diudea

Publisher: John Wiley and Sons
Year: 2010
Weight: 24 KB
Volume: 32
Category: Article
ISSN: 0931-7597
DOI: 10.1002/chin.200132292

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Spectra of Regular Graphs and Hypergraph

Spectra of Regular Graphs and Hypergraphs and Orthogonal Polynomials

✍ Wen-Ch'ing Winnie Li; Patrick Solé 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 339 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

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 color polynomials of Fibonacci graphs

✍ Sherif El-Basil 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 216 KB

On color polynomials of Fibonacci graphs

✍ Sherif El-Basil 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 216 KB

A recursion exists among the coefficients of the color polynomials of some of the families of graphs considered in recent work of Balasubramanian and Ramaraj.' Such families of graphs have been called Fibonacci graphs. Application to king patterns of lattices is given. The method described here appl

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