Flashcards in D1 Deck (13)
Explain why a network cannot have an odd number of vertices of odd degree
Each edge contributes 2 to the sum of degree, hence this sum must be even.
Therefore there must be an even number of vertices of odd degree
consists of points (vertices) which are connected by arcs
a graph of graph G, each of whose vertices belong to G and each of whose edges belong to G
of a vertex is the number of edges incident to it
a finite sequence of edges, such that the end vertex of needle in the sequence is the start vertex of the next, and in which no vertex appears more than once.
A closed path (i.e. the end vertex of the last edge is the start vertex of the first edge)
a connected graph with no cycles
a subgraph which included all vertices and is also a tree
Minimum spanning tree
a spanning tree such that the total length of its arcs is as small as possible
a graph in which each of the vertices is connected to every other vertex
consists of 2 sets of vertices X and Y. The edges only join vertices in X to vertices in Y, not vertices within a set
the pairing of some or all of the elements of on set X, with some elements of a second set Y