The Friendship Theorem states that if any two people, of a group of at least three people, have exactly one friend in common, then there is always a person who is everybody's friend. In this paper, we generalize the Friendship Theorem to the case that in a group of at least three people, if every two friends have one or two common friends and every pair of strangers have exactly one friend then there exist one person who is friend to everybody in the group. In particular, we show that the graph corresponding to this problem is of type G = K₁∨(sK₂ + tK₃), where s and t are non-negative integers and Kₘ is the complete graph on m vertices.
@article{bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1593,
author = {Mohammad Hailat},
title = {On a generalization of the friendship theorem},
journal = {Discussiones Mathematicae Graph Theory},
volume = {32},
year = {2012},
pages = {153-160},
zbl = {1255.05159},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1593}
}
Mohammad Hailat. On a generalization of the friendship theorem. Discussiones Mathematicae Graph Theory, Tome 32 (2012) pp. 153-160. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1593/
[000] [1] J. Bondy, Kotzig's Conjecture on generalized friendship graphs - a survey, Annals of Discrete Mathematics 27 (1985) 351-366. | Zbl 0573.05036
[001] [2] P. Erdös, A. Rènyi and V. Sós, On a problem of graph theory, Studia Sci. Math 1 (1966) 215-235. | Zbl 0144.23302
[002] [3] R. Gera and J. Shen, Extensions of strongly regular graphs, Electronic J. Combin. 15 (2008) # N3 1-5. | Zbl 1158.05342
[003] [4] J. Hammersley, The friendship theorem and the love problem, in: Surveys in Combinatorics, London Math. Soc., Lecture Notes 82 (Cambridge University Press, Cambridge, 1989) 127-140.
[004] [5] N. Limaye, D. Sarvate, P. Stanika and P. Young, Regular and strongly regular planar graphs, J. Combin. Math. Combin. Compt 54 (2005) 111-127. | Zbl 1084.05020
[005] [6] J. Longyear and T. Parsons, The friendship theorem, Indag. Math. 34 (1972) 257-262. | Zbl 0243.05006
[006] [7] E. van Dam and W. Haemers, Graphs with constant μ and μ̅, Discrete Math. 182 (1998) 293-307, doi: 10.1016/S0012-365X(97)00150-7. | Zbl 0901.05068
[007] [8] H. Wilf, The friendship theorem in combinatorial mathematics and its applications, Proc. Conf. Oxford, 1969 (Academic Press: London and New York, 1971) 307-309.