Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightData Structurechevron_rightIn a graph if e=[u, v], Then u and v are called

In a graph if e=[u, v], Then u and v are called

  • Q. In a graph if e=[u, v], Then u and v are called
  • 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. Graphs are represented using ............
  • filter_dramaExplanation
    Answer is : B
    None.
  • 2. Space complexity for an adjacency list of an undirected graph having large values of V (vertices) and E (edges) is ___________
  • filter_dramaExplanation
    Answer is : C
    None.
  • 3. Determine the number of vertices for the given Graph or Multigraph?G is a 4-regular Graph having 12 edges.
  • filter_dramaExplanation
    Answer is : B
    None.
  • 4. The graphs G1 and G2 with their incidences matrices given are Isomorphic.

    e1 e2 e3 e4 e5 e6
    v1 1 0 0 0 0 0
    v2 1 1 0 0 0 1
    v3 0 1 1 0 1 0
    v4 0 0 1 1 0 0
    v5 0 0 0 1 1 1



    e1 e2 e3 e4 e5 e6
    v1 0 0 1 0 0 0
    v2 1 0 1 0 1 0
    v3 1 1 0 1 0 0
    v4 0 1 0 0 0 1
    v5 0 0 0 1 1 1
  • filter_dramaExplanation
    Answer is : A
    None.
  • 5. In which case adjacency list is preferred in front of an adjacency matrix?
  • filter_dramaExplanation
    Answer is : B
    None.

Data StructureTopics

leaderboardLeaderboard
  • Rahul Kumar

    191 Points

  • VIKRAM JEET

    54 Points

  • GEETHIKA CHOWDARY

    53 Points

  • sunita saini

    52 Points

  • Zain

    49 Points