construct friendship graph
The FriendshipGraph(m) function creates the friendship graph on 2m+1 vertices.
It is formed by joining m copies of the cycle graph on 3 elements together at a single common vertex.
F≔Graph 1: an undirected unweighted graph with 7 vertices and 9 edge(s)
"Friendship graph", Wikipedia. http://en.wikipedia.org/wiki/Friendship_graph
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.
The GraphTheory[SpecialGraphs][FriendshipGraph] command was introduced in Maple 2019.
For more information on Maple 2019 changes, see Updates in Maple 2019.
Download Help Document
What kind of issue would you like to report? (Optional)