Friendship Decompositions of Graphs: The general problem

descriptionPublicationkeyboard_double_arrow_right Article 01 Jan 2012Publisher:Scientific Research Publishing, Inc.Journal:Open Journal of Applied Sciences, volume 2, pages 30-33 (issn: 2165-3917, eissn: 2165-3925,

Copyright policy )

Authors: Teresa Sousa;

doi: 10.4236/ojapps.2012.24b008

Friendship Decompositions of Graphs: The general problem

- Summary
- Metrics

Abstract

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.

Related Organizations

Universidade Nova de Lisboa
Portugal

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average

Found an issue? Give us feedback

0

Average

gold

Fields of Science (3) View all

Fields of Science

Related to Research communities

EUTOPIA Open Research Portal