Triangle Graph
The triangle graph is the cycle graph 👁 C_3
, which is isomorphic to the complete
graph 👁 K_3
as well as to the complete tripartite graph 👁 K_(3×1)=K_(1,1,1)
and the triangular
snake graph 👁 TS_3
.
The triangle graph is the line graph of both the claw graph and itself. It is a rigid graph.
The term "triangle graph" is also used to refer to any triangular graph, of which the usual triangle graph is the simplest case.
A 👁 C_3
subgraph of a graph is called a graph triangle.
See also
Complete Graph, Cycle Graph, Graph Triangle, Triangular Graph, Triangular Grid Graph, Triangular Snake GraphExplore with Wolfram|Alpha
References
Skiena, S. Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Reading, MA: Addison-Wesley, p. 144, 1990.Referenced on Wolfram|Alpha
Triangle GraphCite this as:
Weisstein, Eric W. "Triangle Graph." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/TriangleGraph.html
