| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8903147 | Discrete Mathematics | 2018 | 7 Pages |
Abstract
We determine the maximum clustering coefficients among all connected regular graphs of a given order, as well as among all connected subcubic graphs of a given order. In both cases, we characterize all extremal graphs. Furthermore, we determine the maximum increase of the clustering coefficient caused by adding a single edge.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Michael Gentner, Irene Heinrich, Simon Jäger, Dieter Rautenbach,