✦ LIBER ✦

Two problems in the enumeration of unlabelled graphs

✍ Scribed by E.M. Wright

Publisher: Elsevier Science
Year: 1974
Tongue: English
Weight: 285 KB
Volume: 9
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(74)90011-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The random selection of unlabeled graphs

✍ John D Dixon; Herbert S Wilf 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 447 KB

The chromatic polynomial of an unlabeled

The chromatic polynomial of an unlabeled graph

✍ P Hanlon 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 615 KB

A combinatorial solution of two related

A combinatorial solution of two related problems in sequence enumeration

✍ James W. Reilly 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 207 KB

Two-Connected Augmentation Problems in P

Two-Connected Augmentation Problems in Planar Graphs

✍ J.Scott Provan; Roger C Burk 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 167 KB

Given a weighted undirected graph G and a subgraph S of G, we consider the problem of adding a minimum-weight set of edges of G to S so that the resulting Ž . subgraph satisfies specified edge or vertex connectivity requirements between pairs of nodes of S. This has important applications in upgradi

The enumeration of connected graphs and

The enumeration of connected graphs and linked diagrams

✍ Albert Nijenhuis; Herbert S Wilf 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 201 KB

Enumeration of Perfect Matchings in Grap

Enumeration of Perfect Matchings in Graphs with Reflective Symmetry

✍ Mihai Ciucu 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 759 KB

A plane graph is called symmetric if it is invariant under the reflection across some straight line. We prove a result that expresses the number of perfect matchings of a large class of symmetric graphs in terms of the product of the number of matchings of two subgraphs. When the graph is also centr