# friendshipGraph -- Returns a friendship Graph

## Synopsis

• Usage:
G = friendshipGraph n
• Inputs:
• Outputs:
• G, an instance of the type Graph,

## Description

Friendship graphs of size n are a special case of windmill graphs. A friendship graph of size n is n 3-cycles that all share one common vertex.

 i1 : G = friendshipGraph 4 o1 = Graph{0 => {1, 3, 5, 7, 2, 4, 6, 8}} 1 => {0, 2} 2 => {0, 1} 3 => {0, 4} 4 => {0, 3} 5 => {0, 6} 6 => {0, 5} 7 => {0, 8} 8 => {0, 7} o1 : Graph i2 : H = windmillGraph (3,4) o2 = Graph{0 => {1, 3, 5, 7, 2, 4, 6, 8}} 1 => {0, 2} 2 => {0, 1} 3 => {0, 4} 4 => {0, 3} 5 => {0, 6} 6 => {0, 5} 7 => {0, 8} 8 => {0, 7} o2 : Graph