Scribd Logo
Upload

Welcome to Scribd!

  • 57 views

    Discrete Mathematics: Graph Theory 1

    Uploaded by

    Isif Sethi
    This document introduces basic concepts in graph theory, including definitions of a graph as a pair of vertices and edges, different types of edges and graphs, and graph-related concepts like paths, cycles, degrees. It defines a graph, examples of edges and vertices, and special types of graphs like weighted, directed, bipartite, and complete graphs. It also discusses concepts like connectedness, paths, cycles, and degrees of vertices.

    Copyright:

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

    Discrete Mathematics: Graph Theory 1

    Uploaded by

    Isif Sethi
    57 views18 pages
    This document introduces basic concepts in graph theory, including definitions of a graph as a pair of vertices and edges, different types of edges and graphs, and graph-related concepts like paths, cycles, degrees. It defines a graph, examples of edges and vertices, and special types of graphs like weighted, directed, bipartite, and complete graphs. It also discusses concepts like connectedness, paths, cycles, and degrees of vertices.

    Original Description:

    Graph Theory 1

    Original Title

    Discrete Mathematics

    Copyright

    © © All Rights Reserved

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document introduces basic concepts in graph theory, including definitions of a graph as a pair of vertices and edges, different types of edges and graphs, and graph-related concepts like paths, cycles, degrees. It defines a graph, examples of edges and vertices, and special types of graphs like weighted, directed, bipartite, and complete graphs. It also discusses concepts like connectedness, paths, cycles, and degrees of vertices.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    57 views18 pages

    Discrete Mathematics: Graph Theory 1

    Uploaded by

    Isif Sethi
    This document introduces basic concepts in graph theory, including definitions of a graph as a pair of vertices and edges, different types of edges and graphs, and graph-related concepts like paths, cycles, degrees. It defines a graph, examples of edges and vertices, and special types of graphs like weighted, directed, bipartite, and complete graphs. It also discusses concepts like connectedness, paths, cycles, and degrees of vertices.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    of 18

    Discrete Mathematics

    Graph Theory 1

    1
    Introduction

     What is a graph G?
     It is a pair G = (V, E),
    where
     V = V(G) = set of vertices
     E = E(G) = set of edges
     Example:
     V = {s, u, v, w, x, y, z}
     E = {(x,s), (x,v)1, (x,v)2, (x,u),
    (v,w), (s,v), (s,u), (s,w), (s,y),
    (w,y), (u,y), (u,z),(y,z)}
    2
    Edges
     An edge may be labeled by a pair of vertices, for
    instance e = (v,w).
     e is said to be incident on v and w.
     Isolated vertex = a vertex without incident
    edges.

    3
    Special edges
     Parallel edges
     Two or more edges
    joining a pair of vertices
     in the example, a and b
    are joined by two parallel
    edges
     Loops
     An edge that starts and
    ends at the same vertex
     In the example, vertex d
    has a loop

    4
    Special graphs

     Simple graph
     A graph without loops
    or parallel edges.
     Weighted graph
     A graph where each
    edge is assigned a
    numerical label or
    “weight”.

    5
    Directed graphs (digraphs)

    G is a directed graph or
    digraph if each edge
    has been associated
    with an ordered pair
    of vertices, i.e. each
    edge has a direction

    6
    Complete graph K n

    The complete graph Kn is


    the graph with n vertices
    and every pair of vertices is
    joined by an edge.
    The figure represents K5

    7
    Bipartite graphs
     A graph G = (V, E) is V1
    V2
    bipartite if there exist
    subsets
     V and V of V such that
    1 2

    V ∩ V = ∅, V ∪ V = V,
    1 2 1 2

    and
     each edge in E is
    incident on one vertex
    in V and one vertex in
    1

    V.2

    8
    Not bipartite
     Here vertex set can be partitioned
    into two subsets V1 and V2 such
    that each edge is incident on one
    vertex in V1 and one vertex in V2.
     Now consider the vertices v4, v5,
    and v6. Since v4 and v5 are
    adjacent, one is in V1 and the
    other in V2. We may assume that
    v4 is in V1 and that v5 is in V2.
    Since v5 and v6 are adjacent and
    v5 is in V2, v6 is in V1. Since v4
    and v6 are adjacent and v4 is in
    V1, v6 is in V2. But now v6 is in
    both V1 and V2, which is a
    contradiction
     since V1 and V2 are disjoint.
    Therefore, the graph in Figure is
    not bipartite.

    9
    Complete bipartite graph Km,n

     A bipartite graph is the


    complete bipartite graph Km,n
    if every vertex in V(G1) is
    joined to a vertex in V(G2)
    and conversely,
     |V(G1)| = m

     |V(G2)| = n
    10
    Connected graphs
     A graph is connected if
    every pair of vertices
    can be connected by a
    path

    11
    Not connected graphs

    12
    Path

     A path of length n is a
    v w
    sequence of n + 1
    vertices and n
    consecutive edges
     No repeated vertices
    in simple path

    13
    Cycles
     A cycle (or circuit) is
    a path of nonzero
    length from v to v
    with no repeated
    edges.

     A simple cycle is a cycle


    from v to v in which,
    except for the beginning
    and ending vertices that
    are both equal to v, there
    are no repeated vertices.

    14
    Paths & Cycles

    15
    Solution

    16
    Degree of a vertex
     The degree of a vertex
    v, denoted by (v), is
    the number of edges
    incident on v
     Example:
     (a) = 4, (b) = 3,
     (c) = 4, (d) = 6,
     (e) = 4, (f) = 4,
     (g) = 3.

    17
    Reference
     ‘Discrete Mathematics’ by Richard
    Johnsonbaugh, 8th Edition
     Section 8.1 and Section 8.2

    18

    You might also like