图论GraphTheorych1章节幻灯片.pptVIP

* A tournament may have more than one vertex with maximum outdegree, so there may be no clear winner-in the example below, every vertex has outdegree 2 and indegree 2. Choosing a champion when several team have the maximum number of wins can be difficult. Although there need not be a clear winner, we show next that there must always be a team x such that, for every other team z, either x beats z or x beats some team that beats z. * 1.4.29. Definition. In a digraph, a king is a vertex from which every vertex is reachable by a path of length at most 2. * 1.4.30. Proposition (Landau [1953]) Every tournament has a king. Proof: Let x be a vertex in a tourqament T. If x is not a king, then some vertex y is not reachable from x by a path of length at most 2. Hence no successor of x is a predecessor of y. Since T is an orientation of a clique, every successor of x must therefore be a successor of y. Also y?x. Hence d+(y) d+(x). * If y is not a king, then we repeat the argument to find z with yet larger qutdegree. Since T is finite, we cannot forever obtain vertices of successively higher outdegree. The procedure must terminate, and it can terminate only when we have found a king. * Example.5.1.16. Use Theorem 5.1.21 to prove that every tournament has a spanning path. * * * P20-1.2.2 * P20-1.2.2 * P60 上方 * * * * 1.4.4. Application. A finite state machine (also called finite automaton or discrete system) has a number of possible states. Such a system can be modeled using a digraph in which vertices represent the states and edges represent the possible transitions petween states. * 1.4.5. Application.Markov chain. For example, suppose that weather has two states: good and bad. Air masses move slowly enough that tomorrows weather tends to be like todays. .... * 1.4.6. Definition. A digraph is a path if it is a simple digraph whose vertices can be linearly ordered so that there is an edge with tail u and head v if and only if v immediately follows u