| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8903124 | Discrete Mathematics | 2018 | 11 Pages |
Abstract
The probability of obtaining k components in this process for complete bipartite graphs is determined as well as a formula for the expected number of components in any graph. A generic recurrence and some additional basic properties are discussed.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Zhanar Berikkyzy, Steve Butler, Jay Cummings, Kristin Heysse, Paul Horn, Ruth Luo, Brent Moran,