Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Friendship_graph> ?p ?o. }
Showing items 1 to 48 of
48
with 100 items per page.
- Friendship_graph abstract "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.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_graph thumbnail Friendship_graph_8.svg?width=300.
- Friendship_graph wikiPageID "24363442".
- Friendship_graph wikiPageRevisionID "556183798".
- Friendship_graph author1Link "Paul Erdős".
- Friendship_graph author2Link "Alfréd Rényi".
- Friendship_graph author3Link "Vera T. Sós".
- Friendship_graph chromaticIndex "2".
- Friendship_graph chromaticNumber "3".
- Friendship_graph diameter "2".
- Friendship_graph edges "3".
- Friendship_graph first "Alfréd".
- Friendship_graph first "Paul".
- Friendship_graph first "Vera T.".
- Friendship_graph girth "3".
- Friendship_graph hasPhotoCollection Friendship_graph.
- Friendship_graph imageCaption "The friendship graph F8.".
- Friendship_graph last "Erdős".
- Friendship_graph last "Rényi".
- Friendship_graph last "Sós".
- Friendship_graph name "Friendship graph".
- Friendship_graph notation "Fn".
- Friendship_graph properties Eulerian_path.
- Friendship_graph properties Factor-critical_graph.
- Friendship_graph properties Planar_graph.
- Friendship_graph properties Unit_distance_graph.
- Friendship_graph radius "1".
- Friendship_graph vertices "2".
- Friendship_graph year "1966".
- Friendship_graph subject Category:Parametric_families_of_graphs.
- Friendship_graph subject Category:Planar_graphs.
- Friendship_graph type Abstraction100002137.
- Friendship_graph type Communication100033020.
- Friendship_graph type Graph107000195.
- Friendship_graph type PlanarGraphs.
- Friendship_graph type VisualCommunication106873252.
- Friendship_graph comment "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.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_graph label "Friendship graph".
- Friendship_graph label "Grafo de la amistad".
- Friendship_graph label "友誼定理".
- Friendship_graph sameAs Grafo_de_la_amistad.
- Friendship_graph sameAs m.07s4ybn.
- Friendship_graph sameAs Q5504427.
- Friendship_graph sameAs Q5504427.
- Friendship_graph sameAs Friendship_graph.
- Friendship_graph wasDerivedFrom Friendship_graph?oldid=556183798.
- Friendship_graph depiction Friendship_graph_8.svg.
- Friendship_graph isPrimaryTopicOf Friendship_graph.