Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Butterfly_graph> ?p ?o. }
Showing items 1 to 38 of
38
with 100 items per page.
- Butterfly_graph abstract "In the mathematical field of graph theory, the butterfly graph (also called the bowtie graph and the hourglass graph) is a planar undirected graph with 5 vertices and 6 edges. It can be constructed by joining 2 copies of the cycle graph C3 with a common vertex and is therefore isomorphic to the friendship graph F2.The butterfly Graph has diameter 2 and girth 3, radius 1, chromatic number 3, chromatic index 4 and is both Eulerian and unit distance. It is also a 1-vertex-connected graph and a 2-edge-connected graph.There are only 3 non-graceful simple graphs with five vertices. One of them is the butterfly graph. The two others are cycle graph C5 and the complete graph K5.".
- Butterfly_graph thumbnail Butterfly_graph.svg?width=300.
- Butterfly_graph wikiPageID "4372111".
- Butterfly_graph wikiPageRevisionID "542453765".
- Butterfly_graph automorphisms "8".
- Butterfly_graph chromaticIndex "4".
- Butterfly_graph chromaticNumber "3".
- Butterfly_graph diameter "2".
- Butterfly_graph edges "6".
- Butterfly_graph girth "3".
- Butterfly_graph hasPhotoCollection Butterfly_graph.
- Butterfly_graph name "Butterfly graph".
- Butterfly_graph properties Eulerian_path.
- Butterfly_graph properties Planar_graph.
- Butterfly_graph properties Unit_distance_graph.
- Butterfly_graph radius "1".
- Butterfly_graph vertices "5".
- Butterfly_graph subject Category:Individual_graphs.
- Butterfly_graph subject Category:Planar_graphs.
- Butterfly_graph type Abstraction100002137.
- Butterfly_graph type Communication100033020.
- Butterfly_graph type Graph107000195.
- Butterfly_graph type IndividualGraphs.
- Butterfly_graph type PlanarGraphs.
- Butterfly_graph type VisualCommunication106873252.
- Butterfly_graph comment "In the mathematical field of graph theory, the butterfly graph (also called the bowtie graph and the hourglass graph) is a planar undirected graph with 5 vertices and 6 edges. It can be constructed by joining 2 copies of the cycle graph C3 with a common vertex and is therefore isomorphic to the friendship graph F2.The butterfly Graph has diameter 2 and girth 3, radius 1, chromatic number 3, chromatic index 4 and is both Eulerian and unit distance.".
- Butterfly_graph label "Butterfly graph".
- Butterfly_graph label "Grafo mariposa".
- Butterfly_graph label "Graphe papillon".
- Butterfly_graph sameAs Grafo_mariposa.
- Butterfly_graph sameAs Graphe_papillon.
- Butterfly_graph sameAs m.07s9rdv.
- Butterfly_graph sameAs Q3035340.
- Butterfly_graph sameAs Q3035340.
- Butterfly_graph sameAs Butterfly_graph.
- Butterfly_graph wasDerivedFrom Butterfly_graph?oldid=542453765.
- Butterfly_graph depiction Butterfly_graph.svg.
- Butterfly_graph isPrimaryTopicOf Butterfly_graph.
