✦ LIBER ✦

Spectra of matching polynomials

✍ Scribed by K. Balasubramanian

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 470 KB
Volume: 208
Category: Article
ISSN: 0009-2614
DOI: 10.1016/0009-2614(93)89065-p

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Matching polynomials of fullerene cluste

Matching polynomials of fullerene clusters

✍ K. Balasubramanian 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 646 KB

Matching polynomials of fullerene cages for &,-CsO are computed and analyzed. Based on these results the tirst few coeffkients of the matching polynomials of C60-Cw cages are obtained. The matching polynomials thus computed are useful in the characterization of aromaticities, computation of the gran

An introduction to matching polynomials

✍ E.J Farrell 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 540 KB

On the theory of the matching polynomial

✍ C. D. Godsil; I. Gutman 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 325 KB 👁 1 views

## Abstract In this paper we report on the properties of the matching polynomial α(__G__) of a graph __G__. We present a number of recursion formulas for α(__G__), from which it follows that many families of orthogonal polynomials arise as matching polynomials of suitable families of graphs. We con

The matching polynomial of a regular gra

The matching polynomial of a regular graph

✍ Robert A. Beezer; E.J. Farrell 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 588 KB

The matching polynomial of a graph has coefficients that give the number ofmatchings in the graph. For a regular graph, we show it is possible to recover the order, degree, girth and number of minimal cycles from the matching polynomial. If a graph is characterized by its matching polynomial, then i

Matching polynomials: A matrix approach

Matching polynomials: A matrix approach and its applications

✍ E.J. Farrell; S.A. Wahid 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 426 KB

A new approach is formuiatedfor the matching polynomial m(G) of a graph G. A matrix A(G) is associated with G. A certain function de$ned on A(G) yields the matching polynomial of G. This approach leads to a simple characterization of m(G). It also facilitates a technique for constructing graphs with

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