|
gptkbp:instanceOf
|
gptkb:mathematical_concept
|
|
gptkbp:automorphismGroup
|
gptkb:symmetric_group_S_n
|
|
gptkbp:chromaticNumber
|
n
|
|
gptkbp:cliqueNumber
|
n
|
|
gptkbp:degreeOfEachVertex
|
n-1
|
|
gptkbp:edgeCount
|
n(n-1)/2
|
|
gptkbp:hasConnection
|
true
|
|
gptkbp:hasPerfectMatching
|
true if n is even
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
K n
|
|
gptkbp:isBiconnected
|
true
|
|
gptkbp:isBipartite
|
true if n<=2
|
|
gptkbp:isCayleyGraph
|
true
|
|
gptkbp:isChordalGraph
|
true
|
|
gptkbp:isCompleteMultipartite
|
true for n=2
|
|
gptkbp:isDistanceTransitive
|
true
|
|
gptkbp:isEdgeCritical
|
true
|
|
gptkbp:isEdgeTransitive
|
true
|
|
gptkbp:isEulerian
|
true if n is odd
|
|
gptkbp:isGraphComplement
|
empty graph on n vertices
|
|
gptkbp:isHamiltonian
|
true
|
|
gptkbp:isHypoeulerian
|
false
|
|
gptkbp:isHypohamiltonian
|
false
|
|
gptkbp:isInducedSubgraphOf
|
K_m for m>=n
|
|
gptkbp:isKRegular
|
true, k=n-1
|
|
gptkbp:isLineGraph
|
true for n=2,3
|
|
gptkbp:isMaximalGraph
|
true
|
|
gptkbp:isMinimalGraph
|
false
|
|
gptkbp:isPancyclic
|
true
|
|
gptkbp:isPerfect
|
true
|
|
gptkbp:isRamseyGraph
|
true
|
|
gptkbp:isRegular
|
true
|
|
gptkbp:isSelfComplementary
|
true if n=1 or n=4
|
|
gptkbp:isSelfDual
|
true for n=1,2
|
|
gptkbp:isSimpleGraph
|
true
|
|
gptkbp:isSplitGraph
|
true
|
|
gptkbp:isSupergraphOf
|
K_k for k<=n
|
|
gptkbp:isSymmetricGraph
|
true
|
|
gptkbp:isThresholdGraph
|
true
|
|
gptkbp:isTriangleFree
|
true for n<=2
|
|
gptkbp:isTriconnected
|
true for n>=4
|
|
gptkbp:isTuranGraph
|
true for n=2
|
|
gptkbp:isUniversalGraph
|
true for graphs with n vertices
|
|
gptkbp:isVertexCritical
|
true
|
|
gptkbp:isVertexTransitive
|
true
|
|
gptkbp:nonPlanarFor
|
n>=5
|
|
gptkbp:planarFor
|
n<=4
|
|
gptkbp:refersTo
|
complete graph on n vertices
|
|
gptkbp:usedIn
|
gptkb:extremal_graph_theory
gptkb:Ramsey_theory
combinatorics
graph theory
|
|
gptkbp:vertices
|
n
|
|
gptkbp:bfsParent
|
gptkb:Higher_K-theory
gptkb:higher_K-theory
|
|
gptkbp:bfsLayer
|
6
|