# Friendship graph

Friendship graph
The friendship graph F8.
Vertices 2n+1
Edges 3n
Diameter 2
Girth 3
Chromatic number 3
Chromatic index 2n
Properties Unit distance
Planar
Eulerian
factor-critical
Notation Fn
The friendship graphs F2, F3 and F4.

In the mathematical field of graph theory, the friendship graph (or Dutch windmill graph or n-fan) Fn is a planar undirected graph with 2n+1 vertices and 3n edges.[1]

The friendship graph Fn can be constructed by joining n copies of the cycle graph C3 with a common vertex.[2]

By construction, the friendship graph Fn is isomorphic to the windmill graph Wd(3,n). It is unit distance with girth 3, diameter 2 and radius 1. The graph F2 is isomorphic to the butterfly graph.

## Friendship theorem

The friendship theorem of Paul Erdős, Alfréd Rényi, and Vera T. Sós (1966)[3] states that the finite graphs with the property that every two vertices have exactly one neighbor in common are exactly the friendship graphs. Informally, if a group of people has the property that every pair of people has exactly a friend in common, then there must be one person who is a friend to all the others. However, for infinite graphs, there can be many different graphs with the same cardinality that have this property.[4] A combinatorial proof was given by Mertzios and Unger. [5] Another proof was given by Craig Huneke [6]

## Labeling and colouring

The friendship graph has chromatic number 3 and chromatic index 2n. Its chromatic polynomial can be deduced from the chromatic polynomial of the cycle graph C3 and is equal to $(x-2)^n (x-1)^n x$.

The friendship graph Fn is edge-graceful if and only if n is odd. It is graceful if and only if n ≡ 0 (mod 4) or n ≡ 1 (mod 4).[7][8]

Every friendship graph is factor-critical.

## Extremal graph theory

According to extremal graph theory, every graph with sufficiently many edges (relative to its number of vertices) must contain a k-fan. More specifically, this is true for an n-vertex graph if the number of edges is

$\left\lfloor \frac{n^2}{4}\right\rfloor + f(k),$

where f(k) is k2 − k if k is odd, and f(k) is k2 − 3k/2 if k is even. These bounds generalize Turán's theorem on the number of edges in a triangle-free graph, and they are the best possible bounds for this problem, in that for any smaller number of edges there exist graphs that do not contain a k-fan.[9]

## References

1. ^
2. ^ Gallian, J. A. "Dynamic Survey DS6: Graph Labeling." Electronic J. Combinatorics, DS6, 1-58, Jan. 3, 2007. [1].
3. ^ Erdős, Paul; Rényi, Alfréd; Sós, Vera T. (1966), On a problem of graph theory, Studia Sci. Math. Hungar. 1: 215–235.
4. ^ Chvátal, Václav; Kotzig, Anton; Rosenberg, Ivo G.; Davies, Roy O. (1976), There are $\scriptstyle 2^{\aleph_\alpha}$ friendship graphs of cardinal $\scriptstyle\aleph_\alpha$, Canadian Mathematical Bulletin 19 (4): 431–433, doi:10.4153/cmb-1976-064-1.
5. ^ Mertzios, George; Walter Unger (2008). "The friendship problem on graphs". Relations, Orders and Graphs: Interaction with Computer Science.
6. ^ Huneke, Craig. "The Friendship Theorem." The American Mathematical Monthly 109.2 (2002): 192-94. JSTOR. Mathematical Association of America. Web. <http://www.jstor.org/discover/10.2307/2695332?uid=3739832&uid=2129&uid=2&uid=70&uid=4&uid=3739256&sid=21102213900737>
7. ^ J.C. Bermond, A. E. Brouwer, and A. Germa, "Systèmes de triplets et différences associées", Problèmes Combinatoires et Théorie des Graphes, Colloq. Intern. du CNRS, 260, Editions du Centre Nationale de la Recherche Scientifique, Paris (1978) 35-38.
8. ^ J. C. Bermond, A. Kotzig, and J. Turgeon, On a combinatorial problem of antennas in radioastronomy, in Combinatorics, A. Hajnal and V. T. Sos, eds., Colloq. Math. Soc. János Bolyai, 18, 2 vols. North-Holland, Amsterdam (1978) 135-149.
9. ^ Erdős, P.; Füredi, Z.; Gould, R. J.; Gunderson, D. S. (1995), Extremal graphs for intersecting triangles, Journal of Combinatorial Theory, Series B 64 (1): 89–100, doi:10.1006/jctb.1995.1026, MR 1328293.