Scribd Logo
Upload

Welcome to Scribd!

  • Bipin Tripathi Kumaon Institute of Technology: Surprise Test # 1, 2013 Campus: BTKIT

    Uploaded by

    Changder Narayan
    18 views1 page
    This document contains a surprise test for a Master of Computer Application graph theory course. The test contains 10 multiple choice or true/false questions about graph theory concepts, including: 1) Two homeomorphic graphs have the same adjacency matrix representation. 2) A simple graph with n vertices and k components has at most (k-n)(k+n-1)/2 edges. 3) DFS is used to determine the center of any tree.

    Original Description:

    Original Title

    Graph Theory

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains a surprise test for a Master of Computer Application graph theory course. The test contains 10 multiple choice or true/false questions about graph theory concepts, including: 1) Two homeomorphic graphs have the same adjacency matrix representation. 2) A simple graph with n vertices and k components has at most (k-n)(k+n-1)/2 edges. 3) DFS is used to determine the center of any tree.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    18 views1 page

    Bipin Tripathi Kumaon Institute of Technology: Surprise Test # 1, 2013 Campus: BTKIT

    Uploaded by

    Changder Narayan
    This document contains a surprise test for a Master of Computer Application graph theory course. The test contains 10 multiple choice or true/false questions about graph theory concepts, including: 1) Two homeomorphic graphs have the same adjacency matrix representation. 2) A simple graph with n vertices and k components has at most (k-n)(k+n-1)/2 edges. 3) DFS is used to determine the center of any tree.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 1

    TCS (604)

    by0

    BIPIN TRIPATHI KUMAON INSTITUTE OF TECHNOLOGY


    SURPRISE TEST # 1, 2013 Campus: BTKIT MASTER OF COMPUTER APPLICATION GRAPH THEORY

    (Time: 2 hours )

    (Total marks: 50)

    NOTE: Your answer might be wrong but a wrong answer with strong mathematical foundation will be treated as good than the idle students, you are advised to attempt all the questions

    1. Critically comment on the following (a) Two Homeomorphic graph has same adjacency matrix representation. (b) (c) (d) (e)

    (5 10 = 50)

    k+n1) A simple graph with n vertices and k component has at most (kn)(2 edges. A connected graph G is a Hamiltonian graph if it can be decomposed into circuits. DFS is used to determine center of any tree Prims algorithm is better than Krushkals algorithm for nding spanning tree of any graph. (f ) A disconnected nonplanar graph with v vertices, e edges and f faces holds the theorem ve+2=f (g) This graph contains an Euler Circuit.

    (h) Minimum Crossing number of K5 is 6, draw such graph according to your explanation. (i) A tree with n vertices and e edges has n k branches and k + e n chords, where k is the number of components in tree. (j) BFS can be used to construct shortest path tree in any weighted graph G.

    SKY IS THE LIMIT

    You might also like