complete k-partite graph
A complete k-partite graph is a maximal k-partite
graph. In other words, a graph is complete k-partite provided
that its vertex set admits a partition
such that for any and , uv is an edge if and
only if .
For any tuple , there is up to graph isomorphism a
single complete k-partite graph with maximal stable sets
such that for each , there are exactly
vertices in . This graph is denoted by .
Below we display the 3-partite complete graph :
Title | complete k-partite graph |
---|---|
Canonical name | CompleteKpartiteGraph |
Date of creation | 2013-03-22 12:17:18 |
Last modified on | 2013-03-22 12:17:18 |
Owner | mps (409) |
Last modified by | mps (409) |
Numerical id | 8 |
Author | mps (409) |
Entry type | Definition |
Classification | msc 05C15 |
Synonym | complete -partite graph |