Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightData Structurechevron_right. If every node u in G is adjacent to every other node v in G, A graph...

. If every node u in G is adjacent to every other node v in G, A graph...

  • Q. . If every node u in G is adjacent to every other node v in G, A graph is said to be
  • filter_dramaExplanation
    Answer is : B
    None.

Discussion

    No one started the discussion yet. Break the ice and start the conversation.
    Please Login to be part of the discussion.

Similar Questions

  • 1. Breadth first search __________
  • filter_dramaExplanation
    Answer is : B
    None.
  • 2. Number of vertices with odd degrees in a graph having a eulerian walk is ________
  • filter_dramaExplanation
    Answer is : D
    None.
  • 3. Two or more And Inverter Graphs can represent same function.
  • filter_dramaExplanation
    Answer is : A
    None.
  • 4. Which of these adjacency matrices represents a simple graph?
  • filter_dramaExplanation
    Answer is : D
    None.
  • 5. The time complexity to calculate the number of edges in a graph whose information in stored in form of an adjacency matrix is ____________
  • filter_dramaExplanation
    Answer is : D
    None.

Data StructureTopics

leaderboardLeaderboard
  • Rahul Kumar

    191 Points

  • VIKRAM JEET

    54 Points

  • GEETHIKA CHOWDARY

    53 Points

  • sunita saini

    52 Points

  • Zain

    49 Points