A graph in which every node is connected to every other node is called a:
Correct Answer: Option C — Complete graph
Explanation:A complete graph has an edge connecting every pair of distinct vertices.
Submitted by: PaperMCQs
Help us keep PaperMCQs accurate. Reports are reviewed by the admin team.
Continue with your PaperMCQs account
Log in or create an account using your email address. Use a separate PaperMCQs password—never enter your Gmail or email-provider password here.