Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Hypercube_graph> ?p ?o. }
Showing items 1 to 40 of
40
with 100 items per page.
- Hypercube_graph abstract "In graph theory, the hypercube graph Qn is a regular graph with 2n vertices, 2n−1n edges, and n edges touching each vertex. It can be obtained as the one-dimensional skeleton of the geometric hypercube; for instance, Q3 is the graph formed by the 8 vertices and 12 edges of a three-dimensional cube. Alternatively, it can be obtained from the family of subsets of a set with n elements, by making a vertex for each possible subset and joining two vertices by an edge whenever the corresponding subsets differ in a single element.Hypercube graphs should not be confused with cubic graphs, which are graphs that have exactly three edges touching each vertex. The only hypercube that is a cubic graph is Q3.".
- Hypercube_graph thumbnail Hypercubestar.svg?width=300.
- Hypercube_graph wikiPageID "6706815".
- Hypercube_graph wikiPageRevisionID "605420108".
- Hypercube_graph automorphisms "n! 2n".
- Hypercube_graph chromaticNumber "2".
- Hypercube_graph diameter "n".
- Hypercube_graph edges "2".
- Hypercube_graph girth "4".
- Hypercube_graph hasPhotoCollection Hypercube_graph.
- Hypercube_graph imageCaption "The hypercube graph Q4".
- Hypercube_graph name "Hypercube graph".
- Hypercube_graph notation "Qn".
- Hypercube_graph properties Bipartite_graph.
- Hypercube_graph properties Distance-regular_graph.
- Hypercube_graph properties Hamiltonian_path.
- Hypercube_graph properties Symmetric_graph.
- Hypercube_graph properties Unit_distance_graph.
- Hypercube_graph vertices "2".
- Hypercube_graph subject Category:Parametric_families_of_graphs.
- Hypercube_graph subject Category:Regular_graphs.
- Hypercube_graph type Abstraction100002137.
- Hypercube_graph type Communication100033020.
- Hypercube_graph type Graph107000195.
- Hypercube_graph type RegularGraphs.
- Hypercube_graph type VisualCommunication106873252.
- Hypercube_graph comment "In graph theory, the hypercube graph Qn is a regular graph with 2n vertices, 2n−1n edges, and n edges touching each vertex. It can be obtained as the one-dimensional skeleton of the geometric hypercube; for instance, Q3 is the graph formed by the 8 vertices and 12 edges of a three-dimensional cube.".
- Hypercube_graph label "Grafo hipercubo".
- Hypercube_graph label "Hypercube (graphe)".
- Hypercube_graph label "Hypercube graph".
- Hypercube_graph label "Граф гиперкуба".
- Hypercube_graph sameAs Grafo_hipercubo.
- Hypercube_graph sameAs Hypercube_(graphe).
- Hypercube_graph sameAs m.0gjh5c.
- Hypercube_graph sameAs Q958394.
- Hypercube_graph sameAs Q958394.
- Hypercube_graph sameAs Hypercube_graph.
- Hypercube_graph wasDerivedFrom Hypercube_graph?oldid=605420108.
- Hypercube_graph depiction Hypercubestar.svg.
- Hypercube_graph isPrimaryTopicOf Hypercube_graph.
