GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Algebra
  • Applied Mathematics
  • Calculus and Analysis
  • Discrete Mathematics
  • Foundations of Mathematics
  • Geometry
  • History and Terminology
  • Number Theory
  • Probability and Statistics
  • Recreational Mathematics
  • Topology
  • Alphabetical Index
  • Random Entry
  • New in MathWorld

This view

  • Original page
  • New address

GeezerVison is showing mathworld.wolfram.com — Complete Tripartite Graph -- from Wolfram MathWorld

Search

Complete Tripartite Graph


DOWNLOAD Mathematica NotebookDownload Wolfram Notebook

A complete tripartite graph is the k=3 case of a complete k-partite graph. In other words, it is a tripartite graph (i.e., a set of graph vertices decomposed into three disjoint sets such that no two graph vertices within the same set are adjacent) such that every vertex of each set of graph vertices is adjacent to every vertex in the other two sets. If there are p, q, and r graph vertices in the three sets, the complete tripartite graph (sometimes also called a complete trigraph) is denoted K_(p,q,r).

Special classes are summarized in the following table.

K_(p,q,r)special class
K_(1,1,r)(r,2)-fan graph
K_(1,2,r)(r,3)-fan graph
K_(2,2,r)(4,r)-cone graph
CompleteTripartiteGraph

Some special cases are summarized in the following table, some of which are illustrated above.

nnameK_(p,q,r)
3triangle graphK_(1,1,1)
4diamond graphK_(1,1,2)
5(3,2)-fan graphK_(1,1,3)
55-wheel graphK_(1,2,2)
6octahedral graph K_(2,2,2)K_(2,2,2)
6(3,3)-fan graphK_(1,2,3)
6(4,2)-fan graphK_(1,1,4)
7(4,3)-cone graphK_(2,2,3)
7(4,3)-fan graphK_(1,2,4)
7(5,2)-fan graphK_(1,1,5)
8(4,4)-cone graphK_(2,2,4)
8(5,3)-fan graphK_(1,2,5)
99-circulant graph Ci_9(1,2,4)K_(3,3,3)
9(4,5)-cone graphK_(2,2,5)
12circulant graph Ci_(12)(1,2,4,5)K_(4,4,4)
15circulant graph Ci_(15)(1,2,4,5,7)K_(5,5,5)

The number of Hamiltonian cycles in the graph K_(k,m,n) can be efficiently computed using a general complete k-partite graph recurrence (Horák and Tovarek 1979). A closed-form formula is also known (submitted as a problem, 2025).

Spectral comparisons ask which nonisomorphic graph on 3n vertices is closest to K_(n,n,n) in graph spectral distance. Jovanović et al. (2026) refuted two conjectures proposing K_(n-1,n,n+1) as this minimizer for n>=4. Their counterexample H_n is obtained from K_(n-1,n,n) by adjoining a new graph vertex adjacent to every graph vertex in the part of size n-1 and to no others. For the taxicab metric d_1 and Euclidean metric d_2 on the ordered spectra, d_1(K_(n,n,n),H_n)->1 and d_2(K_(n,n,n),H_n)^2->1/2. The second limit is for the squared distance, not the distance itself.


See also

Complete Bipartite Graph, Complete Graph, Complete k-Partite Graph, Cone Graph, Fan Graph, Graph Spectral Distance, k-Partite Graph

Explore with Wolfram|Alpha

WolframAlpha

More things to try:

  • complete tripartite graph
  • Bernoulli B(16)
  • cusps of sqrt |x-2| - cbrt |x+2|

References

--. Submitted problem to Amer. Math. Monthly. Feb. 2025.Chia, G. L. and Sim, K. A. "On the Skewness of the Join of Graphs." Disc. Appl. Math. 161, 2405-2409, 2013.Horák, P. and Tovarek, L. "On Hamiltonian Cycles of Complete n-Partite Graphs." Math. Slovaca 29, 43-47, 1979.House of Graphs. Complete Tripartite Graphs. Triangle K_3, Diamond Graph, Octahedron K_{2,2,2}, K_2 + 3K_1, K_2 + 4K_1, and others.Jovanović, I. M.; Sedlar, J.; and Škrekovski, R. "Two Conjectures on the Cospectrality of Complete Tripartite Graphs Are False." 13 Oct 2026. https://arxiv.org/abs/2610.18636.

Referenced on Wolfram|Alpha

Complete Tripartite Graph

Cite this as:

Weisstein, Eric W. "Complete Tripartite Graph." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/CompleteTripartiteGraph.html

Subject classifications

You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.