| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4650556 | Discrete Mathematics | 2008 | 9 Pages |
Abstract
We investigate the maximum number of elements in an optimal t-friendship decomposition of graphs of order n . Asymptotic results will be obtained for all fixed t⩾4t⩾4 and for t=2,3t=2,3 exact results will be derived.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Teresa Sousa,