Abstract
A graph that consists of t cliques sharing a vertex v is said to be a t-friendship graph with center v. A friendship graph is a graph that is t-friendship for some . We solve the problem of finding the best upper bound for the size of a greedy 2-friendship decomposition and a greedy friendship decomposition of graphs of order n.
| Original language | Unknown |
|---|---|
| Pages (from-to) | 32-34 |
| Journal | Open Journal of Discrete Mathematics |
| Volume | 1 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 1 Jan 2011 |