Discuss Forum

1.

A grapgh having an edge from vertex to every other vertex is called.

  • A. "Lightly connected"
  • B. "Lightly connected"
  • C. "Lightly connected"
  • D. "Lightly connected"

Answer: Option A

Explanation:

Post your comments here:

Name:
Mobile:
Email:(Optional)

» Your comments will be displayed only after manual approval.