Scribd Logo
Upload

Welcome to Scribd!

  • 54 views

    Graph Theory: Types of Graphs

    Uploaded by

    Arush
    The document discusses different types of graphs: - Null graphs have vertices but no edges - Trivial graphs have one vertex - Simple graphs have no loops or parallel edges - Multigraphs allow parallel edges but no loops - Pseudographs allow both parallel edges and loops - Regular graphs have all vertices of the same degree - Complete graphs have an edge between every pair of vertices

    Copyright:

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

    Graph Theory: Types of Graphs

    Uploaded by

    Arush
    54 views13 pages
    The document discusses different types of graphs: - Null graphs have vertices but no edges - Trivial graphs have one vertex - Simple graphs have no loops or parallel edges - Multigraphs allow parallel edges but no loops - Pseudographs allow both parallel edges and loops - Regular graphs have all vertices of the same degree - Complete graphs have an edge between every pair of vertices

    Original Title

    3.GT

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses different types of graphs: - Null graphs have vertices but no edges - Trivial graphs have one vertex - Simple graphs have no loops or parallel edges - Multigraphs allow parallel edges but no loops - Pseudographs allow both parallel edges and loops - Regular graphs have all vertices of the same degree - Complete graphs have an edge between every pair of vertices

    Copyright:

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

    Graph Theory: Types of Graphs

    Uploaded by

    Arush
    The document discusses different types of graphs: - Null graphs have vertices but no edges - Trivial graphs have one vertex - Simple graphs have no loops or parallel edges - Multigraphs allow parallel edges but no loops - Pseudographs allow both parallel edges and loops - Regular graphs have all vertices of the same degree - Complete graphs have an edge between every pair of vertices

    Copyright:

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

    GRAPH THEORY

    TYPES OF GRAPHS
    TYPES OF GRAPHS
    1)Null Graph
    A graph having no edges and n vertices is called a Null Graph Nn
    There are three vertices named ‘a’, ‘b’, and ‘c’, but there are no edges
    among them. Hence it is a Null Graph N3

    2)Trivial Graph
    A graph with only one vertex is called a Trivial Graph.
    Here, the graph is only one vertex ‘a’ with no other edges. Hence it is a
    Trivial graph.

    3)Simple Graph
    A graph with no loops and no parallel edges

    4)Multigraph
    A graph with parallel edges but no loops

    5) Pseudograph
    A graph with parallel edges and loops
    5) Regular Graph
    A graph G is said to be regular, if all its vertices have
    the same degree.
    In a graph, if the degree of each vertex is ‘k’, then the
    graph is called a ‘k-regular graph’.
    6) Complete Graphs
    A complete graph on n vertices, denoted
    by Kn, is a simple graph that contains exactly
    .
    one edge between each pair of its distinct
    vertices ie if every vertex is connected with K1
    every other vertex.
    The graphs Kn, for n = 1, 2, 3, 4, 5, 6, are
    shown .
    Kn has n(n − 1)/2 edges and is a regular graph of degree n − 1.
    7)

    Cn is a 2-regular graph with


    n vertices and n edges.

    8)

    Wn is regular graph for


    only n=3.
    It has n+1 vertices and
    2n edges.
    9)

    V1= {a,b}
    V2={c,d,e}
    10)

    • .
    K 3, 2

    • .
    • . V1= {a,b,c}
    • . V2= {d,e}
    • .
    |V1|= 3
    |V2|= 2
    K 3, 3 K m, n is not regular if m≠n

    K m, n = K n, m
    Note:

    1) Cn (n≥3)is bipartite for n as even.

    2) A graph which contains a triangle can not be bipartite.


    …
    𝒏𝟐
    Example: Prove that the number of edges in a bipartite graph with n vertices in at most .
    𝟒
    Solution: Let the vertex set V be partitioned into two subsets V1 and V2.
    Let V1 contain x vertices, then V2 contains n-x vertices.
    The number of edges of the graph will be largest when each of the x vertices in V1 is connected to each of (n-
    x) vertices in V2.

    Hence, the largest number of edges


    f(x)=x(n-x) (which is a function of x )
    ∴ f’(x)=n-2x , V1 V2
    f’’(x)= -2
    Now, for maxima/minima, f’(x) = 0 x n-x
    𝑛
    n-2x = 0 i.e. x=
    2
    and f”(x)=-2 <0.
    𝑛
    Hence, f(x) is maximum when x=
    2

    𝑛 𝑛 𝑛2
    So maximum number of edges= (n- ) =
    2 2 4

    You might also like