𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the connected components of a random permutation graph with a given number of edges

✍ Scribed by Acan, Hüseyin; Pittel, Boris

Book ID
121281928
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
459 KB
Volume
120
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some results on characterizing the edges
Some results on characterizing the edges of connected graphs with a given domination number
✍ Laura A. Sanchis 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 821 KB

A dominatin# set for a graph G = (V, E) is a subset of vertices V' c\_ V such that for all v • V-V' there exists some u• V' for which {v,u} •E. The domination number of G is the size of its smallest dominating set(s). For a given graph G with minimum size dominating set D, let mz(G, D) denote the nu