Graph theory definitions 0.0 / 5 ? MathematicsGraph theorydiscrete mathematicsUniversityNone Created by: ShannibeanCreated on: 09-05-18 14:04 29854310167 Across 1. A -------- H of a graph G is a graph all of whose vertices are of G and all of whose edges are of G (8) 6. A ------- N is a weighted digraph where each arc, a , is assigned a positive number ( psi(a)) called it's capacity. (7) 7. A ----is a walk in which all the edges AND all the vertices are different. (4) 8. A ------ ---- in a graph is a walk that starts and ends at the same vertex. (6, 4) 9. Let G be a connected planar graph, and F be any face of a plane drawing of G. Then the degree of F, written deg(F) is the number of edges of the boundary of face F (4, 6) Down 2. A graph G ( without loops ) is -_---------- if you can assign one of k colours to each vertex so that adjacent vertices have different colours (1, 10) 3. A digraph D is a ------ ------- if the arcs of D are all distinct and there are no loops. (6, 7) 4. A ------ -----l is a closed walk in which all the edges are different. (6, 5) 5. A -------- ----- is a graph for which an Eulerian trail exists (8, 5) 10. A graph is --------- if there is a path between any two of its vertices. Otherwise it is disconnected. (12)
Comments
Report