answersLogoWhite

0

The term "cyclic graph" is not well-defined.

If you mean a graph that is not acyclic, then the answer is 3. That would be the union of a complete graph on 3 vertices and any number of isolated vertices.

If you mean a graph that is (isomorphic to) a cycle, then the answer is n.

If you are really asking the maximum number of edges, then that would be the triangle numbers such as n (n-1) /2.

User Avatar

Wiki User

14y ago

Still curious? Ask our experts.

Chat with our AI personalities

EzraEzra
Faith is not about having all the answers, but learning to ask the right questions.
Chat with Ezra
SteveSteve
Knowledge is a journey, you know? We'll get there.
Chat with Steve
DevinDevin
I've poured enough drinks to know that people don't always want advice—they just want to talk.
Chat with Devin

Add your answer:

Earn +20 pts
Q: How many minimum edges in a Cyclic graph with n vertices?
Write your answer...
Submit
Still have questions?
magnify glass
imp