Statements (22)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:graph
|
| gptkbp:adjacency |
every pair of distinct vertices is adjacent
|
| gptkbp:automorphismGroup |
gptkb:symmetric_group_S_{n+1}
|
| gptkbp:chromaticNumber |
n+1
|
| gptkbp:clique_number |
n+1
|
| gptkbp:contains_all_possible_edges |
yes
|
| gptkbp:degree_of_each_vertex |
n
|
| gptkbp:diameter |
1
|
| gptkbp:edge_connectivity |
n
|
| gptkbp:Eulerian |
yes (if n is even)
|
| gptkbp:girth |
3
|
| gptkbp:Hamiltonian |
yes
|
| gptkbp:isRegular |
yes
|
| gptkbp:notation |
K_{n+1}
|
| gptkbp:number_of_edges |
(n+1)*n/2
|
| gptkbp:planar |
no (for n+1 > 4)
|
| gptkbp:self-complementary |
yes (for n+1=1 or 2 mod 4)
|
| gptkbp:vertex_connectivity |
n
|
| gptkbp:vertices |
n+1
|
| gptkbp:bfsParent |
gptkb:symmetric_group_S_{n+1}
|
| gptkbp:bfsLayer |
8
|
| https://www.w3.org/2000/01/rdf-schema#label |
complete graph K {n+1}
|