✦ LIBER ✦

General Method for the Computation of Matching Polynomials of Graphs

✍ Scribed by Balakrishnarajan, M. M.; Venuvanalingam, P.

Book ID: 118242439
Publisher: American Chemical Society
Year: 1994
Tongue: English
Weight: 540 KB
Volume: 34
Category: Article
ISSN: 0095-2338
DOI: 10.1021/ci00021a017

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Generalized -graphs for nonzero roots of

Generalized -graphs for nonzero roots of the matching polynomial

✍ Cheng Yeaw Ku; Kok Bin Wong 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 314 KB

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

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

Computer generation of distance polynomi

Computer generation of distance polynomials of graphs

✍ K. Balasubramanian 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 582 KB

A computer program is developed to compute distance polynomials of graphs containing up to 200 vertices. The code also computes the eigenvalues and the eigenvectors of the distance matrix. It requires as input only the neighborhood information from which the program constructs the distance matrix. T

Computer generation of the characteristi

Computer generation of the characteristic polynomials of chemical graphs

✍ K. Balasubramanian 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 497 KB

A computer program based on the Frame method for the characteristic polynomials of graphs is developed. This program makes use of an efficient polynomial algorithm of Frame for generating the coefficients in the characteristic polynomials of graphs. This program requires as input only the set of ver

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