Friendship Decompositions of Graphs:The general problem

摘要：

　　A friendship graph is a graph consisting of cliques sharing a common vertex.In this paper we investigate the maximum number of elements in an optimal friendship decomposition of graphs of order n.We obtain upper and lower bounds for this number.These bounds relate this problem with the classical Ramsey numbers.

关键词： Graph Decompositions Friendship Graph Friendship Decompositions

作者: Teresa Sousa

作者单位: Departamento de Matemática and Centro de Matemática e Aplica(c)(ō)es Faculdade de Ciências e Tecnologia, Universidade Nova de Lisboa Quinta da Torre.2829-516 Caparica, Portugal

会议类型: 国际会议

会议名称: 2012年国际工程应用数学研讨会

会议地点: 北京

会议语种:英文

页码: 30-33

在线出版日期: 2012-10-26（万方平台首次上网日期，不代表论文的发表时间）