In graph theory, Kn usually denotes the complete graph on n vertices: a graph in which every pair of distinct vertices is joined by an edge. The letter K is also used in other graph terms and notation, so its precise meaning depends on the context; the subscript and surrounding words usually make it clear.
What K Means in Graph Notation
The standard notation Kn names a complete graph with n vertices. A graph is complete when no two distinct vertices are left unconnected: every possible edge between a pair is present. The notation is most often used for simple, undirected graphs, where edges join two different vertices and there are no loops or repeated edges.
The K is conventionally associated with the German word komplett, meaning complete. The subscript tells you how many vertices the graph has, not how many edges. For example, K5 has five vertices. Because all five vertices are mutually adjacent, it has ten edges.
In diagrams, vertices are usually drawn as dots and edges as lines. A drawing of a complete graph can look different depending on how its vertices are positioned, but the graph is the same if the connections between vertices are unchanged. Lines crossing in a drawing do not count as extra vertices unless a vertex is explicitly marked at the crossing.
Examples of Complete Graphs
The smallest complete graphs are useful for understanding the notation. K1 consists of one vertex and no edges; there is no pair of distinct vertices to connect. K2 has two vertices joined by one edge. K3 is a triangle, with three vertices and all three possible edges. K4 has four vertices and six edges. It is often drawn as a triangle with a fourth vertex inside, connected to each corner.
For small values, the number of edges may be easiest to see by listing the pairs of vertices. For larger graphs, use the general formula described below. A quick reference is:
- K1: 1 vertex, 0 edges.
- K2: 2 vertices, 1 edge.
- K3: 3 vertices, 3 edges.
- K4: 4 vertices, 6 edges.
- K5: 5 vertices, 10 edges.
These examples also show why a complete graph becomes dense quickly. Adding a vertex to Kn requires connecting it to each of the n vertices already present, so the edge count rises by n, not just by one.
How to Count Edges in Kn
In a complete graph, each edge corresponds to one unordered pair of distinct vertices. The number of ways to choose two vertices from n is the binomial coefficient “n choose 2,” so the number of edges is n(n − 1)/2. Equivalently, it is n choose 2.
For example, K6 has 6 × 5 / 2 = 15 edges. The division by two matters: if you count the neighbors of every vertex, each edge is counted once from each endpoint. Each vertex of Kn has degree n − 1, because it is adjacent to every other vertex. Summing all degrees gives n(n − 1); dividing by two gives the same edge formula. This is an instance of the handshaking lemma.
The formula is useful in reverse, too. If a simple graph has n vertices and exactly n(n − 1)/2 edges, it must be complete: that is the maximum possible number of edges for a simple graph on those vertices. For instance, a simple graph with six vertices can have at most 15 edges. If it has all 15, every possible pair is connected.
Key Properties of Complete Graphs
Complete graphs have several predictable properties. For n at least 2, every vertex has degree n − 1, and the graph is connected: there is a path between every two vertices, in fact a direct edge. If n is at least 3, deleting any one vertex still leaves a connected complete graph. More generally, removing fewer than n − 1 vertices from Kn leaves a connected graph, provided at least one vertex remains.
The distance between any two distinct vertices is 1, since they are adjacent. Thus the diameter, the greatest shortest-path distance between vertices, is 1 for Kn when n is at least 2. The single-vertex graph is usually assigned diameter 0. Also, every complete graph is planar only up to four vertices: K4 can be drawn without crossings, but K5 cannot.
Complete graphs also have simple coloring behavior. A proper vertex coloring gives different colors to adjacent vertices. Since every pair of vertices in Kn is adjacent, all n vertices need different colors, so its chromatic number is n. This makes complete graphs a basic example when studying coloring bounds and graph structure.
Other Uses of K in Graph Theory
A bare letter k often represents an integer parameter rather than a particular named graph. For example, a k-regular graph is one in which every vertex has degree k. Here, k is the common degree; it does not mean the graph is complete. Kn is itself an (n − 1)-regular graph, but many regular graphs are not complete. A cycle with five vertices is 2-regular, for example, but it does not connect every pair of vertices.
The phrase “complete graph” can also appear with two subscripts. Km,n denotes a complete bipartite graph with two vertex sets of sizes m and n. Every vertex in one set is joined to every vertex in the other set, but there are no edges within either set. Its edge count is mn. In particular, K3,3 has six vertices and nine edges; it is not the same graph as K6, which has 15 edges.
Other symbols can look similar but carry distinct meanings. The vertex-connectivity of a graph is commonly written κ(G), and edge-connectivity is commonly written λ(G). The chromatic number is usually χ(G). These are Greek letters, not the capital Latin K used in Kn. In plain-text notes, fonts or missing formatting can make such distinctions harder to see, so check the definition provided by the author.
Why K5 and K3,3 Matter
K5 and K3,3 are especially important in the study of planar graphs. A planar graph can be drawn in the plane without edges crossing, except at shared endpoints. Kuratowski’s theorem states that a finite graph is planar exactly when it contains no subgraph that is a subdivision of K5 or K3,3. A subdivision replaces edges with paths by inserting vertices along them, so the forbidden structure need not appear as a literal copy with straight edges.
This result explains why these two graphs appear in discussions of planarity, but it does not mean that every nonplanar graph is exactly one of them. A larger graph may be nonplanar because it contains one of these structures in subdivided form. For the basic examples, K5 is nonplanar because it has too many edges for a simple planar graph on five vertices, while K3,3 is nonplanar despite having only nine edges; the familiar planar edge bound alone does not rule it out.
How to Recognize the Intended Meaning
When you encounter K in a textbook, problem, or diagram, use the surrounding notation instead of assuming it always means the same thing. These checks usually settle the meaning:
- A capital K with one subscript, such as K7, almost always names a complete graph on that many vertices.
- A capital K with two subscripts, such as K2,5, commonly names a complete bipartite graph.
- A lowercase k in a phrase such as “k-regular” is a numerical parameter, often a degree.
- A Greek κ or λ usually denotes a connectivity quantity; check the author’s definitions if the font is unclear.
Notation is not completely universal across every subfield or source. A paper may define a symbol for its own purposes, and lecture notes may use a lowercase letter where a book uses uppercase. Look at the first definition, the graph’s stated number of vertices and edges, and whether the text describes all pairs as adjacent. Those clues are more reliable than the letter by itself.
Common Misunderstandings
The most frequent mistake is reading the subscript of Kn as the edge count. It gives the vertex count; the edge count is n(n − 1)/2. Another easy mix-up is to confuse Kn with Km,n. In the first, every pair of vertices is adjacent. In the second, edges only run across two separate parts.
It is also incorrect to assume that every graph with many edges is complete. A graph is complete only if every distinct pair is joined. For example, a graph on five vertices with nine edges is not K5, because K5 has ten. A drawing can be misleading as well: two crossing edges do not meet at a vertex unless the crossing is marked as one. Graphs are defined by their vertices and connections, not by the visual arrangement used to draw them.
Frequently Asked Questions
What does Kn mean?
Kn means the complete graph with n vertices. Every distinct pair of vertices has an edge between them.
How many edges are in Kn?
There are n(n − 1)/2 edges, because each edge is one pair of vertices. For example, K5 has 5 × 4 / 2 = 10 edges.
Is K3 a triangle?
Yes. K3 has three vertices, with an edge between each pair, so its three edges form a triangle.
What is the difference between Kn and Km,n?
Kn is a complete graph in which every pair is connected. Km,n is complete bipartite: vertices are split into two parts, and every cross-part pair is connected, but pairs within one part are not.
Does K mean the number of colors in a graph?
Not by itself. The chromatic number is usually written χ(G). A complete graph Kn does require n colors for a proper vertex coloring, but that is a property of the graph, not the usual meaning of the letter K.
Related
- Assembly Split in CATIA: How to Separate a Product
- Balance Sheet Accounting: How It Works
- J Curve Balance of Payments: How It Works
Try it: the Percentage Formula Generator: percent of, percent change, increase and decrease, with the formula.
More in Charts & pivot tables
- Excel Histogram: Why It Can Feel So FrustratingYes, Excel’s histogram can feel frustrating when it chooses unhelpful bins, hides important settings, or produces a chart…
- MS Excel Scatter Plot: Create and Interpret XY ChartsTo make a scatter plot in Microsoft Excel for Microsoft 365 on Windows, arrange each observation’s X value…
- Create a Pareto Chart in Excel: Steps, Tips, and ExamplesTo create a Pareto chart in Excel for Microsoft 365 on Windows, select a table containing category names…
- Custom Trendline in Excel: How to Add and Format OneTo add a custom trendline in Excel for Microsoft 365 on Windows, select a supported chart, then choose…
- Graph the Line y = x – 5: Slope, Intercepts, and StepsAssuming you mean y = x – 5, graph a straight line with slope 1 and y-intercept -5.…
- Excel Stacked Bar Chart: How to Make the Bars WiderTo make bars wider in an Excel stacked bar chart, select a bar, open Format Data Series, and…
Sources: Function behaviour and menu paths: Microsoft Support documentation for Excel. Method & sources
Spotted an error in this guide? Let us know.