Greedy Friendship Decompositions of Graphs

Research output: Contribution to journalArticlepeer-review


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 languageUnknown
Pages (from-to)32-34
JournalOpen Journal of Discrete Mathematics
Issue number1
Publication statusPublished - 1 Jan 2011

Cite this