Is there a name for a (directed) graph that has exactly one circuit that goes through all of its vertices (in the same direction)? If so, what is it called? Example is as follows:
$$A\to B, B \to C, C \to A$$
where the set of vertices is $A, B, C$.
Is there a name for a (directed) graph that has exactly one circuit that goes through all of its vertices (in the same direction)? If so, what is it called? Example is as follows:
$$A\to B, B \to C, C \to A$$
where the set of vertices is $A, B, C$.
Copyright © 2021 JogjaFile Inc.