Statements (20)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:graph
|
| gptkbp:adjacency |
every pair of distinct vertices is adjacent
|
| gptkbp:automorphismGroup |
gptkb:symmetric_group_S_{2^n}
|
| gptkbp:chromaticNumber |
2^n
|
| gptkbp:clique_number |
2^n
|
| gptkbp:degree_of_each_vertex |
2^n-1
|
| gptkbp:diameter |
1
|
| gptkbp:edge-transitive |
yes
|
| gptkbp:Eulerian |
yes (if n>1)
|
| gptkbp:girth |
3
|
| gptkbp:Hamiltonian |
yes
|
| gptkbp:isRegular |
yes
|
| gptkbp:number_of_edges |
(2^n)*(2^n-1)/2
|
| gptkbp:planar |
no (for n>2)
|
| gptkbp:self-complementary |
no
|
| gptkbp:vertex-transitive |
yes
|
| gptkbp:vertices |
2^n
|
| gptkbp:bfsParent |
gptkb:hypercube_graph
|
| gptkbp:bfsLayer |
6
|
| https://www.w3.org/2000/01/rdf-schema#label |
complete graph K {2^n}
|