Friendship Decompositions of Graphs: The general problem

Teresa Maria Jerónimo Sousa

doi:10.4236/ojapps.2012.24B008

Friendship Decompositions of Graphs: The general problem

Research output: Contribution to journal › Article › peer-review

Abstract

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

Original language	Unknown
Pages (from-to)	30-33
Journal	Open Journal of Applied Sciences
Volume	2
Issue number	4B
DOIs	https://doi.org/10.4236/ojapps.2012.24B008
Publication status	Published - 1 Jan 2012

Access to Document

10.4236/ojapps.2012.24B008

Cite this

@article{596ac6849e78491794f56a61fb8a7d6d,

title = "Friendship Decompositions of Graphs: The general problem",

abstract = "A friendship graph is a graph consisting of cliques sharing a common vertex. In this paperwe investigate the maximum number of elements in an optimal friendship decomposition of graphs oforder n. We obtain upper and lower bounds for this number. These bounds relate this problem with theclassical Ramsey numbers.",

keywords = "Friendship Decompositions, Friendship Graph, Graph Decompositions",

author = "Sousa, {Teresa Maria Jer{\'o}nimo}",

year = "2012",

month = jan,

day = "1",

doi = "10.4236/ojapps.2012.24B008",

language = "Unknown",

volume = "2",

pages = "30--33",

journal = "Open Journal of Applied Sciences",

issn = "2165-3917",

publisher = "Scientific Research Publishing",

number = "4B",

}

TY - JOUR

T1 - Friendship Decompositions of Graphs: The general problem

AU - Sousa, Teresa Maria Jerónimo

PY - 2012/1/1

Y1 - 2012/1/1

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

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

KW - Friendship Decompositions

KW - Friendship Graph

KW - Graph Decompositions

U2 - 10.4236/ojapps.2012.24B008

DO - 10.4236/ojapps.2012.24B008

M3 - Article

SN - 2165-3917

VL - 2

SP - 30

EP - 33

JO - Open Journal of Applied Sciences

JF - Open Journal of Applied Sciences

IS - 4B

ER -