Which of the following data structures has at most one directed edge between a pair of vertices and self loops?

Keep practicing — related questions

• In which of the following data structures, there is exactly one edge directed from every other vertex?
• In which of the following data structures, for every edge (a, b), there is also an edge (b, a)?
• Which of the following data structures is an undirected graph that may contain multiple edges or loops?
• Which of the following data structures is an undirected graph that can be drawn without any crossing of the...
• Which of the following graphs has more than one edge between the same two vertices?
• In _________, its vertex set V can be decomposed into two disjoint subsets V1 and V2 such that every edge i...
• Which of the following data structure is linear data structure?
• Which of the following types of data structure is the one in which each node points to the next node and al...