𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Counting disk graphs

✍ Scribed by Colin McDiarmid; Tobias Müller

Book ID
119236623
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
181 KB
Volume
38
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Counting cubic graphs
Counting cubic graphs
✍ Robert W. Robinson 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 91 KB
Unit disk graphs
Unit disk graphs
✍ Brent N. Clark; Charles J. Colbourn; David S. Johnson 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 878 KB
Counting patterns in graphs
Counting patterns in graphs
✍ Guido Guardabassi 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 326 KB
Counting H-free graphs
Counting H-free graphs
✍ Hans Jürgen Prömel; Angelika Steger 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 269 KB

Let Forb",, (H) denote the class of all H-free graphs on n (labelled) vertices with m edges. In this note we estimate the cardinality of IForb,, by establishing good bounds for the probability that a random graph in the G(n,m)-model does not contain a given subgraph.

Counting Matchings in Graphs
Counting Matchings in Graphs
✍ E.J. Farrell 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 488 KB

A general formula is derivedfor the matching polynomial of an arbitrary graph G. This yields a methodfor counting matchings in graphs. From the general formula, explicit formulae are deducedfor the number of k-matchings in several well-known families of graphs.