Question

7. For the graph shown below at the bottom, answer the following questions a) Is the graph directed or undirected? b) What is the deg ()? c) Is the graph connected or unconnected? If it is not connected, give an example of why not d) ls the graph below an example of a wheel? e) Any multiple edges? 0 What is the deg(E)? ) What is the deg (B)? h) Is CBABC a cycle? D How many edges are there in a graph with 18 vertices ench of degree 5? D is CAE a walk of length 27 ) In an undirected graph, a deg(vertex)-1 is called ) in an undirected graph, a deg(vertex)-0 is called__ m) Is ABABABA closed walk? a) If the sum of all the vertes-degrees equals 1450, the number of edges Any parallel edges? 2 21 3 1 1 5
Answer all the BLANKS from A to N please.
0 0
Add a comment Improve this question Transcribed image text
Answer #1
7
   a) directed   -  Directions are indicated with an  arrow

   b) deg(I) = 3 -  Two out degrees and one in degree

   c) connected  -  No vertex is having a zero degree

   d) No    -  There is no universal vertex is present which is connected to all the vertices.

   e) No multiple edges, No parallel edges

   f) deg+(E) = 1    -  Number of in degrees

   g) deg-(B) = 2    -  Number of out degrees

   h) No    -  Since, There is no direct path from B to C

   i) 45    -  18 * 5 = 90
               number of edges = (90/2) = 45

   j) No    -  CAE has a length of 2 + 6 + 2 = 10

   k) Leaf Vertex

   l) Isolated vertex

   m) Yes       -  From A to B and B to A, there is a direct edge.

   n) 725       -  number of edges = (1450/2) = 725

directed are indicated ith an arro b) deg(I) 3 c) connected d) No Two out degrees and one in degree lo vertex is having a zero degree There is no universal vertex is present which is connected to all the vertices No multiple edges, No parallel edges f) g) deg-(8)-2uber of out degrees h) No 4) 45 deg+(E)1 Number of in degrees Since, There is no direct path from B to 18 5 98 number of edges -(90/2)45 CAE has a length of 2 6-2-18 i) k) Leaf Vertex 1) Isolated vertex m)Yes n) 725 No From A to B and B to A, there is ฮ direct edge. number of edges -(1450/2)725 Edit Pad 8201 Download & Save | more Note: The screenshot is provided for better indentation and understanding. For queries, drop a comment.

Add a comment
Know the answer?
Add Answer to:
Answer all the BLANKS from A to N please. 7. For the graph shown below at...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Write down true (T) or false (F) for each statement. Statements are shown below If a...

    Write down true (T) or false (F) for each statement. Statements are shown below If a graph with n vertices is connected, then it must have at least n − 1 edges. If a graph with n vertices has at least n − 1 edges, then it must be connected. If a simple undirected graph with n vertices has at least n edges, then it must contain a cycle. If a graph with n vertices contain a cycle, then it...

  • Recall the definition of the degree of a vertex in a graph. a) Suppose a graph has 7 vertices, each of degree 2 or 3. Is the graph necessarily connected ? b) Now the graph has 7 vertices, each degree...

    Recall the definition of the degree of a vertex in a graph. a) Suppose a graph has 7 vertices, each of degree 2 or 3. Is the graph necessarily connected ? b) Now the graph has 7 vertices, each degree 3 or 4. Is it necessarily connected? My professor gave an example in class. He said triangle and a square are graph which are not connected yet each vertex has degree 2. (Paul Zeitz, The Art and Craft of Problem...

  • 1. In the following graph, suppose that the vertices A, B, C, D, E, and F represent towns, and th...

    question 1 and 2 please, thank you. 1. In the following graph, suppose that the vertices A, B, C, D, E, and F represent towns, and the edges between those vertices represent roads. And suppose that you want to start traveling from town A, pass through each town exactly once, and then end at town F. List all the different paths that you could take Hin: For instance, one of the paths is A, B, C, E, D, F. (These...

  • 7. Graphs u, u2, u3, u4, u5, u6} and the (a) Consider the undirected graph G...

    7. Graphs u, u2, u3, u4, u5, u6} and the (a) Consider the undirected graph G (V, E), with vertex set V set of edges E ((ul,u2), (u2,u3), (u3, u4), (u4, u5), (u5, u6). (u6, ul)} i. Draw a graphical representation of G. ii. Write the adjacency matrix of the graph G ii. Is the graph G isomorphic to any member of K, C, Wn or Q? Justify your answer. a. (1 Mark) (2 Marks) (2 Marks) b. Consider an...

  • a. b. c. d. e. What are the vertices? Is this graph connected? What is the...

    a. b. c. d. e. What are the vertices? Is this graph connected? What is the degree of vertex C? Edge FE is adjacent to which edges? Does this graph have any bridges? Answer the following questions based on the graph below. 1w a. b. c. d. What are the vertices? What is the degree of vertex u? What is the degree of vertex s? What is one circuit in the graph?

  • In C++ Design a format for storing graphs in files. This will store your graph into a file with t...

    in C++ Design a format for storing graphs in files. This will store your graph into a file with the following requirements: The first line will contain the number of Vertices. The second line will have a ‘U’ or a ‘D’ to tell the system if it is Undirected or Directed. The rest of the lines will be here for each of the edges. Each edge will contain three pieces of information: An integer containing the first Vertex An integer...

  • 5. The in-degree of a vertex in a directed graph is the number of edges directed...

    5. The in-degree of a vertex in a directed graph is the number of edges directed into it. Here is an algorithm for labeling each vertex with its in-degree, given an adjacency-list representation of the graph. for each vertex i: i.indegree = 0 for each vertex i: for each neighbor j of i: j.indegree = j.indegree + 1 Label each line with a big-bound on the time spent at the line over the entire run on the graph. Assume that...

  • Question 1: Given an undirected connected graph so that every edge belongs to at least one...

    Question 1: Given an undirected connected graph so that every edge belongs to at least one simple cycle (a cycle is simple if be vertex appears more than once). Show that we can give a direction to every edge so that the graph will be strongly connected. Question 2: Given a graph G(V, E) a set I is an independent set if for every uv el, u #v, uv & E. A Matching is a collection of edges {ei} so...

  • 6) Below is an adjacency matrix for an undirected graph, size n- 8. Vertices are labeled...

    6) Below is an adjacency matrix for an undirected graph, size n- 8. Vertices are labeled 1 to 8 Rows are labeled 1 through 8, top to bottom. Columns are labeled 1 through 8, left to right. Column labels to the right: 1 2 345 6 78 Row labels are below this: 1 0 0 1 000 0 0 2 0 0 101 1 00 (See a drippy heart?) 3 1 1 0 1 01 0 0 4 0 0...

  • Bonus 1 A walk in a graph G is a sequence of vertices V1, V2, ...,...

    Bonus 1 A walk in a graph G is a sequence of vertices V1, V2, ..., Uk such that {Vi, Vi+1} is an edge of G. Informally, a walk is a sequence of vertices where each step is taken along an edge. Note that a walk may visit the same vertex more than once. A closed walk is a walk where the first and last vertex are equal, i.e. v1 = Uk. The length of a walk is the number...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT