Greedy Friensdhip Decompositions of Graphs

• 作者: Teresa Sousa
• 来源期刊: 离散数学期刊(英文)
• 学科: 数学
• 关键词: FRIENDSHIP GRAPH DECOMPOSITIONS GREEDY DECOMPOSITIONS
• 年，卷（期）: lssxqkyw_2011,（1）
• 页码范围: 32-34
• 页数: 3页
• 分类号: O1

摘要

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.