Friendship graph
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
related reading
- Theorem on friends and strangers - Wikipediaen.wikipedia.org
- Complete graph - Wikipediaen.wikipedia.org
- Exact Stability for Turan's Theoremarxiv.org
- Friendship paradox - Wikipediaen.wikipedia.org
- Matchstick graph - Wikipediaen.wikipedia.org
- Unit distance graph - Wikipediaen.wikipedia.org
- rainbow-turan-full-version.pdfpeople.maths.ox.ac.uk
- Folk theorem (game theory) - Wikipediaen.wikipedia.org
- GraphTheoreticProperties.pdfcs.rice.edu
- [2604.27639] How large part of a graph can be covered by the neighborhoods of k vertices?arxiv.org
- Graph cheatsheet for coding interviews | Tech Interview Handbooktechinterviewhandbook.org
- unit-distance-proof.pdfcdn.openai.com