Name
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>=4 and for t=2,3 exact results will be derived. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.disc.2007.06.042 | Discrete Mathematics |
Keywords | Field | DocType |
friendship,graph decompositon | Discrete mathematics,Graph,Combinatorics,Friendship,Mathematics | Journal |
Volume | Issue | ISSN |
308 | 15 | Discrete Mathematics |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Teresa Sousa | 1 | 9 | 2.72 |