✦ LIBER ✦

Matching polynomials of two classes of graphs

✍ Scribed by Fu-ji Zhang; Ming-kun Zhou

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 616 KB
Volume: 20
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(88)90081-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

Two classes of chromatically unique grap

Two classes of chromatically unique graphs

✍ K.M. Koh; B.H. Goh 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 563 KB

## Let P(G; A) denote the chromatic polynomial of a graph G. G is chromatically unique if G is isomorphic to H for any graph H with P(H; A) = P(G; A). In this paper, we provide two new classes of chromatically unique graphs.

Bicolored Matchings in Some Classes of G

Bicolored Matchings in Some Classes of Graphs

✍ M. C. Costa; D. de Werra; C. Picouleau; B. Ries 📂 Article 📅 2007 🏛 Springer Japan 🌐 English ⚖ 137 KB

Labelings of two classes of plane graphs

✍ Bača Martin 📂 Article 📅 1993 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 197 KB

Subdivision thresholds for two classes o

Subdivision thresholds for two classes of graphs

✍ C.A. Barefoot; L.H. Clark; A.J. Depew; R.C. Entringer; L.A. Székely 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 902 KB

The subdivision threshold for a graph F is the maximum number of edges, ex(n; FS), a graph of order n can have without containing a subdivision of F as a subgraph. We consider two instances: (i) F is the graph formed by a cycle C one vertex of which is adjacent to k vertices not on C, and (ii) F is