Tag: Kn

By Posted on Posted in computer science, math Tagged with , , ,

The tutor considers a problem from Grimaldi about max trail length on Kn. For a briefing about the complete graph Kn, check my post from yesterday. In graph theory, a trail is a route that doesn’t repeat any edges. Unlike …

Math and Comp Sci: Graph theory: Max trail length on complete graph, Kn Read more »

By Posted on Posted in computer science, math Tagged with , , , , ,

The tutor introduces the idea of the complete graph. The complete graph on n vertices, Kn, means the graph in which each vertex is connected to each other one. When two vertices are connected by an edge, they can be …

Math & Comp Sci: Graph theory: Complete graph Read more »