Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01778404n
Noun Concept
Categories: Parametric families of graphs, Planar graphs
EN
friendship graph  Dutch windmill graph  friendship theorem  N-fan
EN
In the mathematical field of graph theory, the friendship graph Fn is a planar, undirected graph with 2n + 1 vertices and 3n edges. Wikipedia
Definitions
Relations
Sources
EN
In the mathematical field of graph theory, the friendship graph Fn is a planar, undirected graph with 2n + 1 vertices and 3n edges. Wikipedia
Planar undirected graph with 2n+1 vertices and 3n edges Wikidata
IS A
theorem
planar graph
windmill graph
unit distance graph
factor-critical graph
+1 relations
STUDIED BY
graph theory
Wikipedia
EN
friendship graph
Wikidata
EN
friendship graph
Wikipedia Redirections
EN
Dutch windmill graph, friendship theorem, N-fan

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License