Solve the questions (27-41) based on the following graph: M 23 33 F 27 38 48 46 51 55 E 25 K 35 42 74 68 N 29 G (27) The Relationship between vertices is (Symmetric or Asymmetric). (28) The end vertices of the edge 25 are: (29) The origin of the edge 51 is: (30) The destination of edge 74 is: (31) The degree of the vertex E is: (32) The in-degree of the vertex N is: (33) The out-degree of the vertex F is: (34) An example of the adjacent vertices is: (35) An incident edge to the vertex K is: (36) An incoming edge of vertex His: (37) An outgoing edge of vertex M is: (38) A loop example is: (39) An example of a directed path is: (40) Vertex F is not reachable from: (41) This graph is connected (True or False).

Solve the questions (27-41) based on the following graph: M 23 33 F 27 38 48 46 51 55 E 25 K 35 42 74 68 N 29 G (27) The Relationship between vertices is (Symmetric or Asymmetric). (28) The end vertices of the edge 25 are: (29) The origin of the edge 51 is: (30) The destination of edge 74 is: (31) The degree of the vertex E is: (32) The in-degree of the vertex N is: (33) The out-degree of the vertex F is: (34) An example of the adjacent vertices is: (35) An incident edge to the vertex K is: (36) An incoming edge of vertex His: (37) An outgoing edge of vertex M is: (38) A loop example is: (39) An example of a directed path is: (40) Vertex F is not reachable from: (41) This graph is connected (True or False).

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Show the formal notation V(...) and E(...) of the graph that is described by the following adjacency matrix. List the edges with vertices in uppercase as follows (X,Y) A BCD 1 10 1 0 0 0 0 0 1 O 1 0 o 10 O 0 0 00 0 O 0 0 0 0 0 0 0 0 1 0 0 O 0 0 0 1 0 E G A. 1 B 1 D 1 V={ E={
You are given a graph with five vertices (1,2,3,4,5). You are also told that the DFS sequence is 123245421 Which of the following are NOT possible edges to be left out of the DFS (2,5) (3,4) (1,4) (3,5)
Show the formal notation V(...) and E(...) of the graph that is described by the following adjacency matrix. List the edges with vertices in uppercase as follows (X,Y) B E F G A 1. 1 1 1 B 1 1 1 1 E F 1 1 G 1 V = { } E = { }
3. From the graph above determine the vertex sequence of the shortest path connecting the following pairs of vertex and give each length: a. V & W b. U & Y c. U & X d. S & V e. S & Z 4. For each pair of vertex in no. 3 give the vertex sequence of the longest path connecting them that repeat no edges. Is there a longest path connecting them?
5. For the following graph G with edges (1,2), (2,3), (3,4), (4,5), (5,6), (6,7), (7,8), (8,9), (9,10), (10,11), (11,12), (10,3), (3,6), (7,12), (11,8), (9,5), (4,7) either prove that G is non-planar or draw G without self-intersections
Question 7 For the following graph, find the vertices adjacent to vertex 2: 1 2 A) 0 123 03 0 13 3.
Draw a graph G containing the following vertices and edges. V(G) = {0, 1, 2, 3, 4, 5, 6} E(G) = { (0, 1), (0, 2), (0, 3), (2, 1), (2, 4), (5, 1), (5, 3)}
Draw a directed acyclic graph with 6 vertices and 14 edges (IF EXIST), IF Doesn't Exist, Give Your Explanation.
3. Construct a graph with connectivity (kappa) =1 and edge connectivity (kappa') = N, where N is any positive integer.
The degree of every vertex of a graph G of order 25 and size 62 is 3, 4, 5 or 6. There are two vertices of degree 4 and 11 vertices of degree 6. How many vertices of G have degree 5?
An undirected weighted graph G is given below Figure 16: An undirected weighted graph has 6 vertices, a through f, and 9 edges. Vertex d is on the left. Vertex f is above and to the right of vertex d. Vertex e is below and to the right of vertex f, but above vertex d. Vertex c is below and to the right of vertex e. Vertex a is above vertex e and to the right of vertex c. Vertex b is below and to the right of vertex a, but above vertex c. The edges between the vertices and their weight are as follows: d and f, 1; d and e, 4; f and e, 2; e and a, 2; f and a, 3; e and c, 5; c and a, 7; c and b, 5; and a and b, 6. (a) What is the minimum weight spanning tree for the weighted graph subject to the condition that edge {d, e} is in the spanning tree? (b) How would you generalize this idea? Suppose you are given a graph G and a particular edge {u, v} in the graph. How would you alter Prim’s algorithm to find the minimum spanning tree subject to the condition that {u, v} is in the tree?
• If a planar graph has 11 vertices and four times as many edges as faces, how many faces does it have? Is there a planar graph with 13 vertices that has three times more edges than faces?