aliensbrain
  • Home
  • Study
  • Quizzes
  • 🎤AI Practicefree
  • Notebooks
  • Community
  • Sign in
  • Data Structures and Algorithms
  • If the number of edges are far less than square of modulu...
Multiple choice

If the number of edges are far less than square of modulus of vertex, then what is the graph called?

  1. Sparse Graph

  2. Null Graph

  3. Directed Graph

  4. Strongly Connected Graph

  5. Edge

Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

Graph is said to be sparse if the number of edges are far less than square of modulus of vertex.

Keep practicing — related questions

  • Which of the following graphs has more than one edge between the same two vertices?
  • Which of the following graphs has more than one edge between the same two vertices?
  • Which of the following types of graphs can be defined as G where each edge e in G is assigned a direction a...
  • If information like cost is associated to the traversal of an edge, then what is the graph called?
  • Which of the following graphs has no path and starts and ends at the same vertex?
  • What two statements are true about the result obtained from calling Math.random()? 1. The result is less th...
  • Which of the following statement(s) is/are correct? i. Data rate is the number of signals sent in 1 second....
  • Which of the following is a square number?
Play the full quiz 🎤 Practise this topic out loud
Advertisement
© Aliensbrain | all rights reserved
  • About
  • Contact
  • Terms and Condition
  • Privacy Policy