Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightData Structurechevron_rightThe column sum in an incidence matrix for a directed graph having no s...

The column sum in an incidence matrix for a directed graph having no s...

  • Q. The column sum in an incidence matrix for a directed graph having no self loop is __________
  • filter_dramaExplanation
    Answer is : A
    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. A graph is a collection of nodes, called
  • filter_dramaExplanation
    Answer is : A
    None.
  • 2. For some sparse graph an adjacency list is more space efficient against an adjacency matrix.
  • filter_dramaExplanation
    Answer is : A
    None.
  • 3. 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.
  • 4. In which of the following case does a Binary Decision Diagram is used for?
  • filter_dramaExplanation
    Answer is : A
    None.
  • 5. If in a DAG N sink vertices and M source vertices exists, then the number of possible stacks in the Graph Structured Stack representation would come out to be N*M.
  • 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