Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 39 views

    TJUSAMO 2012-2013 Graph Theory

    Uploaded by

    Chanthana Chongchareon
    This document contains definitions and problems related to graph theory: 1. It defines basic graph theory terms such as simple graphs, connected graphs, degree, trees, bipartite graphs, complete graphs, paths, cycles, walks, circuits, Hamiltonian paths/cycles, and Eulerian circuits. 2. It lists 7 problems related to graph properties and theorems about graphs, including showing a graph has vertices of equal degree, conditions for an Eulerian circuit, planar graph orientations, and problems about Hamiltonian cycles and configurations of points on a circle. 3. The document provides context for a graph theory class by reviewing previous material and defining key graph theory concepts, then poses several problems for students to consider related to graph properties

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    TJUSAMO 2012-2013 Graph Theory

    Uploaded by

    Chanthana Chongchareon
    39 views2 pages
    This document contains definitions and problems related to graph theory: 1. It defines basic graph theory terms such as simple graphs, connected graphs, degree, trees, bipartite graphs, complete graphs, paths, cycles, walks, circuits, Hamiltonian paths/cycles, and Eulerian circuits. 2. It lists 7 problems related to graph properties and theorems about graphs, including showing a graph has vertices of equal degree, conditions for an Eulerian circuit, planar graph orientations, and problems about Hamiltonian cycles and configurations of points on a circle. 3. The document provides context for a graph theory class by reviewing previous material and defining key graph theory concepts, then poses several problems for students to consider related to graph properties

    Original Description:

    test

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains definitions and problems related to graph theory: 1. It defines basic graph theory terms such as simple graphs, connected graphs, degree, trees, bipartite graphs, complete graphs, paths, cycles, walks, circuits, Hamiltonian paths/cycles, and Eulerian circuits. 2. It lists 7 problems related to graph properties and theorems about graphs, including showing a graph has vertices of equal degree, conditions for an Eulerian circuit, planar graph orientations, and problems about Hamiltonian cycles and configurations of points on a circle. 3. The document provides context for a graph theory class by reviewing previous material and defining key graph theory concepts, then poses several problems for students to consider related to graph properties

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    39 views2 pages

    TJUSAMO 2012-2013 Graph Theory

    Uploaded by

    Chanthana Chongchareon
    This document contains definitions and problems related to graph theory: 1. It defines basic graph theory terms such as simple graphs, connected graphs, degree, trees, bipartite graphs, complete graphs, paths, cycles, walks, circuits, Hamiltonian paths/cycles, and Eulerian circuits. 2. It lists 7 problems related to graph properties and theorems about graphs, including showing a graph has vertices of equal degree, conditions for an Eulerian circuit, planar graph orientations, and problems about Hamiltonian cycles and configurations of points on a circle. 3. The document provides context for a graph theory class by reviewing previous material and defining key graph theory concepts, then poses several problems for students to consider related to graph properties

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 2

    TJUSAMO - Graph Theory

    14VXia
    February 11th, 2013

    Review from Last Week


    1. Let O be a point inside equilateral traingle ABC. Let P , Q, and R be the intersections of AO with
    Q QR RP
    BP CQ 1.
    BC, BO with CA, and CO with AB, respectively. Prove that PAR
    2. Let P be a point in the interior of a triangle ABC, and let D, E, F be the point of intersection of the
    line AP and the side BC of the triangle, of the line BP and the side CA, and of the line CP and
    the side AB, respectively. Prove that the area of triangle ABC must be 6 if the area of each of the
    triangles P F A, P DB, and P EC is 1.

    Graph Theory Definitions


    A simple graph is one in which each edge connects a distinct pair of vertices.
    connected, degree d(v), tree
    A graph is bipartite if its vertices can be split into two disjoint subsets such that edges run only between
    vertices in different subsets.
    The complete graph with n vertices, Kn , is the simple graph that has all possible edges.
    paths, cycles, walks, circuits
    Hamiltonian path/cycle, Eulerian circuit
    A graph is planar if it can be drawn in a plane such that none of its edges intersect (except at vertices).
    Planar graphs have faces. (Euler Characteristic: V E + F = 2.)

    Problems
    1. Show that every graph has at least two vertices with equal degree.
    2. Every connected graph with all degrees even has an Eulerian circuit.
    3. Prove that every finite, simple, planar graph has an orientation such that every vertex has outdegree
    at most 3.
    4. In a tournament with n players (n 4), each player plays against every other player once, and there
    are no draws. Suppose that there are no four players (A, B, C, D) such that A beats B, B beats C,
    C beats D and D beats A. Determine, as a function of n, the largest possible number of unordered
    triples of players (A, B, C) such that A beats B, B beats C and C beats A.

    5. (Diracs Theorem on Hamiltonian cycles) Let G be a graph on n vertices with all degrees at least n/2.
    Show that G has a Hamiltonian cycle.
    6. Find the smallest positive integer n such that for any n points (A1 , A2 , ...An ) chosen on a circle with
    center O, out of the nC2 angles of the form Ai OAj , at least 1000 of these angles have measures no
    greater than 120 .
    7. There are 8 persons at a party. Suppose that for any 5 persons, there are 3 of them who know each
    other. Show that there are 4 persons who know each other.

    You might also like