1

What is the shortest cycle length in an undirected graph?

edit

• sed

asked 2023-06-01 06:56:27 +0000

woof
21 ●1 ●1

edit retag flag offensive close merge delete

add a comment

2

answered 2023-06-01 07:11:01 +0000

djk
21 ●1 ●1

In an undirected graph, the shortest cycle length is 3. This is because in a cycle, you need at least 3 vertices to form a closed loop.

edit flag offensive delete link more

add a comment

Your Answer

Please start posting anonymously - your entry will be published after you log in or create a new account. This space is reserved only for answers. If you would like to engage in a discussion, please instead post a comment under the question or an answer that you would like to discuss