Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightData Structurechevron_rightMaximum degree of any vertex in a simple graph of vertices n is

Maximum degree of any vertex in a simple graph of vertices n is

  • Q. Maximum degree of any vertex in a simple graph of vertices n is
  • filter_dramaExplanation
    Answer is : D
    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. Two directed graphs(G and H) are isomorphic if and only if A=PBP-1, where P and A are adjacency matrices of G and H respectively.
  • filter_dramaExplanation
    Answer is : A
    None.
  • 2. Find the odd out
  • filter_dramaExplanation
    Answer is : C
    None.
  • 3. . 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.
  • 4. If the data collection is in sorted form and equally distributed then the run time complexity of interpolation search is ?
  • filter_dramaExplanation
    Answer is : D
    None.
  • 5. A graph having an edge from each vertex to every other vertex is called a ___________
  • filter_dramaExplanation
    Answer is : A
    None.

Data StructureTopics

leaderboardLeaderboard
  • Rahul Kumar

    191 Points

  • VIKRAM JEET

    54 Points

  • GEETHIKA CHOWDARY

    53 Points

  • sunita saini

    52 Points

  • Zain

    49 Points