Open Journal of Applied Sciences

Volume 2, Issue 4 (December 2012)

ISSN Print: 2165-3917   ISSN Online: 2165-3925

Google-based Impact Factor: 1  Citations  

Friendship Decompositions of Graphs: The general problem

HTML  Download Download as PDF (Size: 132KB)  PP. 30-33  
DOI: 10.4236/ojapps.2012.24B008    3,241 Downloads   5,313 Views  
Author(s)

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.

Share and Cite:

Sousa, T. (2012) Friendship Decompositions of Graphs: The general problem. Open Journal of Applied Sciences, 2, 30-33. doi: 10.4236/ojapps.2012.24B008.

Cited by

No relevant information.

Journals Menu
Follow SCIRP
Contact us
customer@scirp.org
WhatsApp +86 18163351462(WhatsApp)
Click here to send a message to me 1655362766
Paper Publishing WeChat

Copyright © 2026 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.