✳flâneur — a map of the web's best reading

Friendship graph

en.wikipedia.org · 1,082 words · saved by 1 readers

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.The friendship graph Fn can be constructed by joining n copies of the cycle graph C3 with a common vertex, which becomes a universal vertex for the graph.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 graphs are generalized by the triangular cactus graphs.

Friendship graph - Wikipedia Jump to content From Wikipedia, the free encyclopedia Graph of triangles with a shared vertex Friendship graph The friendship graph F 8 . Vertices 2 n + 1 Edges 3 n Radius 1 Diameter 2 Girth 3 Chromatic number 3 Chromatic index 2 n Properties Unit distance Planar Eulerian Factor-critical Locally linear Notation F n Table of graphs and parameters The friendship graphs F 2 , F 3 and F 4 . In the mathematical field of graph theory , the friendship graph (or Dutch windmill graph or n -fan ) F n is a planar , undirected graph with 2 n + 1 vertices and 3 n edges. [ 1 ] T

Explore this link on the map →

related reading