Scribd Logo
Upload

Welcome to Scribd!

  • 5K views

    MCQs Unit 5 Graph Theory

    Uploaded by

    Nitish Kumar
    The document discusses key concepts in graph theory including different types of graphs like pseudographs, regular graphs, bipartite graphs, and trees. It also defines graph properties like chromatic number, vertex coloring, and Euler paths and circuits. The document provides multiple choice questions to test understanding of these graph theory concepts.

    Copyright:

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

    MCQs Unit 5 Graph Theory

    Uploaded by

    Nitish Kumar
    5K views2 pages
    The document discusses key concepts in graph theory including different types of graphs like pseudographs, regular graphs, bipartite graphs, and trees. It also defines graph properties like chromatic number, vertex coloring, and Euler paths and circuits. The document provides multiple choice questions to test understanding of these graph theory concepts.

    Original Title

    MCQs Unit 5 Graph Theory.docx

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses key concepts in graph theory including different types of graphs like pseudographs, regular graphs, bipartite graphs, and trees. It also defines graph properties like chromatic number, vertex coloring, and Euler paths and circuits. The document provides multiple choice questions to test understanding of these graph theory concepts.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    5K views2 pages

    MCQs Unit 5 Graph Theory

    Uploaded by

    Nitish Kumar
    The document discusses key concepts in graph theory including different types of graphs like pseudographs, regular graphs, bipartite graphs, and trees. It also defines graph properties like chromatic number, vertex coloring, and Euler paths and circuits. The document provides multiple choice questions to test understanding of these graph theory concepts.

    Copyright:

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

    UNIT – V GRAPH THEORY

    1. A graph in which loops and parallel edges are allowed is called a


    a)vertices b)edges c) degree of a vertex d) pseudograph

    2. The number of vertices of odd degree in an undirected graph is


    a)odd b)prime c) even d)natural number

    3. A vertex with zero in degree is called a


    a) Sink b) source c) parallel d) degree

    4. If every vertex of a simple graph has the same degree , then the graph is called
    a)Complete Graph b) Regular Graph c) bi-partite Graph d) subgraph

    5. The maximum number of edges in a simple graph with n vertices is


    a) n(n-1)/2 b)n-1/4 c)n-1/5 d)n/2

    6. The number of edges in a bipartite graph with n vertices is at most


    a) n2 b) n2/3 c)n2/4 d)n2/2

    7. If there is a path between every pair of distinct vertices of the graph then the graph is said
    to be
    (a) Disconnected (b) bipartite graph (c) connected (d) source

    8. A connected graph contains an Euler circuit if and only if each of its vertices is of
    (a) Odd degree b) even degree c) prime degree d) no degree

    9. A connected graph contains an Euler path if and only if it has exactly two vertices of
    (a) Even degree b) prime degree (c) odd degree d) no degree

    10. In a graph G if it includes each vertex of G exactly once then the graph is called a
    (a) Euler path b) Euler cycle (c) Hamiltonian Path d) Hamiltonian cycle

    11. A connected graph without any circuits is called a


    (a) tree (b) subgraph (c) spanning graph d) algorithm

    12. A tree with


    (a) n vertices and n edges (b) n vertices and (n-1) edges (c)n -1 vertices and n edges
    (d) n+1 vertices and n edges

    14. The vertex having degree 1 is said to be


    (a) isolated vertex (b) pendant vertex (c) loop (d) parallel

    15. A simple graph in which there is exactly on edge between each pair of distinct vertices then it is
    called
    (a) Regular graph (b) bipartite graph (c) Complete graph (d) tree
    16. K3,3 represents
    a) Bipartite graph b)Complete bipartite graph with 3 vertices in V 1 and V2 c) complete graph
    d) simple graph

    17. A graph G is said to be tree if and only if


    a) At least two paths b) there exists a unique path c) three paths d) four paths

    18. What is Vertex Coloring of a graph?


    a) A condition where any two vertices having a common edge should not have same color
    b) A condition where any two vertices having a common edge should always have same color
    c) A condition where all vertices should have a different color
    d) A condition where all vertices should have same color

    19. Minimum number of colors required for vertex coloring of a graph is called?
    a) Vertex matching b) Chromatic index c) Chromatic number d) color number

    20. What is the chromatic number for an empty graph having n vertices?
    a) 0 b) 1 c) 2 d) n

    21. What will be the Chromatic number for a line graph having n vertices?
    a) 0 b) 1 c) 2 d) n

    22. What will be the Chromatic number for a bipartite graph having n vertices?
    b) 0 b) 1 c) 2 d) n

    23. What will be the Chromatic number for a Complete graph having n vertices?
    c) 0 b) 1 c) 2 d) n

    24. What will be the Chromatic number for a tree having more than one vertice?
    d) 0 b) 1 c) 2 d) Varies with the structure and number of
    vertices of the tree

    25. A graph with Chromatic number less than or equal to k is called?


    a) K Chromatic b) K Colorable c) K chromatic colorable d) K colorable Chromatic

    You might also like