Please if you are not going to answer all please don\'t answer. Please I just ne
ID: 3282331 • Letter: P
Question
Please if you are not going to answer all please don't answer. Please I just need to know the answer. Thank you.
In discrete structures, which of the following are part of a graph?
Traversal, Nodes, Root, Leaves, Verticies, Edges
What is a directed edge?
a. An edge that simply connects two verticies
b. An edge that connects a vertex to itself
c. An edge that connects more than two verticies.
d. An edge that connects two verticies, but only in a specific direction.
How many edges does a pendant vertex have?
a. 0
b.3
c.1
d.2
What is a graph in which each edge connects two different verticies and where no two edges connect the same pair of verticies called?
a. Multigraph
b. Infinite graph
c. Simple graph
d. Directed graph
Explanation / Answer
1. Vertices, Edges. (Other than these two all others are either property or process)
2. d. An edge that connects two verticies, but only in a specific direction.
3. c.1
4. c. Simple graph