How to call a tree with a single branch?

$\begingroup$

How do you call a tree with only one branch (in other words, where every vertex has maximum one direct successor)?

$\endgroup$ 1

1 Answer

$\begingroup$

A connected graph with two vertices of degree one and the rest of degree two is called a path.

If you want to distinguish between successor and predecessor vertices, you can direct the edges all the same direction and obtain a directed path.

$\endgroup$ 0

Your Answer

Sign up or log in

Sign up using Google Sign up using Facebook Sign up using Email and Password Submit

Post as a guest

Post Your Answer Discard

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy