GeezerVisonThe World Wide Web, restored to 800 pixels of glory. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Home|About|Gaming cabinet|Archives|How it works|Starter sites | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
GeezerVison is showing mathworld.wolfram.com — Complete Tripartite Graph -- from Wolfram MathWorld Complete Tripartite Graph
A complete tripartite graph is the Special classes are summarized in the following table.
Some special cases are summarized in the following table, some of which are illustrated above.
The number of Hamiltonian cycles in the graph
Spectral comparisons ask which nonisomorphic graph on See alsoComplete Bipartite Graph, Complete Graph, Complete k-Partite Graph, Cone Graph, Fan Graph, Graph Spectral Distance, k-Partite GraphExplore with Wolfram|AlphaMore things to try: 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 CompleteReferenced on Wolfram|AlphaComplete Tripartite GraphCite 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. |