Scribd Logo
Upload

Welcome to Scribd!

  • 94 views

    Unit 4 MCQS

    Uploaded by

    Hargun Singh Khera
    The document contains 20 multiple choice questions related to graphs and graph theory concepts. The questions cover topics such as: properties of complete graphs, regular graphs, planar graphs, chromatic numbers, cut vertices/edges, shortest paths, and isomorphic graphs. Each question includes 4 possible answer choices with one key answer identified by a letter.

    Copyright:

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

    Unit 4 MCQS

    Uploaded by

    Hargun Singh Khera
    94 views6 pages
    The document contains 20 multiple choice questions related to graphs and graph theory concepts. The questions cover topics such as: properties of complete graphs, regular graphs, planar graphs, chromatic numbers, cut vertices/edges, shortest paths, and isomorphic graphs. Each question includes 4 possible answer choices with one key answer identified by a letter.

    Original Title

    UNIT 4 MCQS

    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 contains 20 multiple choice questions related to graphs and graph theory concepts. The questions cover topics such as: properties of complete graphs, regular graphs, planar graphs, chromatic numbers, cut vertices/edges, shortest paths, and isomorphic graphs. Each question includes 4 possible answer choices with one key answer identified by a letter.

    Copyright:

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

    Unit 4 MCQS

    Uploaded by

    Hargun Singh Khera
    The document contains 20 multiple choice questions related to graphs and graph theory concepts. The questions cover topics such as: properties of complete graphs, regular graphs, planar graphs, chromatic numbers, cut vertices/edges, shortest paths, and isomorphic graphs. Each question includes 4 possible answer choices with one key answer identified by a letter.

    Copyright:

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

    sr.

    Question Key M
    no.
    1 a 1
    in is

    (a) 2450 (b)3450 (c)1000 (d)1225

    2 Every complete graph with n vertices can be drawn without any edge crossing a 1

    if __

    (a)
    (b)
    (c)
    (d)

    3 Consider the following statements c 1

    P: Every complete graph with n vertices is


    Q: Every cycle graph with n vertices is 2-regular. Then

    (a) Only P is true


    (b) Only Q is true
    (c) Both P and Q are true
    (d) Neither P nor Q is true

    4 Let G be a simple undirected graph with 10 vertices and it’s not a complete b 1

    one then how many vertices are there in

    (a) 5 (b) 10 (c) 25 (d) 0


    5 Let G be a simple undirected graph with 10 vertices and 10 edges then how b 1

    many edges are there in

    (a)45 (b) 35 (c) 25 (d) 50


    6 The value of n such that is isomorphic to a 1

    (a) 3 (b) 4 (c) 5 (d) 6

    7 c 1

    The value of n such that and has the same no. of edges

    (a)3 (b) 4 (c) 5 (d) 6


    8 Total number of edges in d 1

    (a) 5 (b) 10 (c) 15 (d) 20

    9 The wheel graph with n vertices is regular if n= a 1

    (a) 3 (b) 4 (c) 5 (d) any natural number

    10 The number of vertices in a 1

    (a) 8 (b) 6 (c) 16 (d) 4

    11 d 2
    in is

    (a) 100 (b) 150 (c)1000 (d)10000

    12 The chromatic number of b 2

    (a) 5 (b) 10 (c) 15 (d) 20

    13 The chromatic number of b 2

    (a) 100 (b) 2 (c) 3 (d) 4

    14 The chromatic number of c 2

    (a) 100 (b) 2 (c) 3 (d) 4

    15 Consider the following statements c 2

    P: The chromatic number of is 2

    Q: The chromatic number of is 2

    Then

    (a) Only P is true


    (b) Only Q is true
    (c) Both P and Q are true
    (d) Neither P nor Q is true
    16 Consider the following statements c 2

    P: The is connected
    Q: The has 3 closed regions
    Then
    (a) Only P is true (b) Only Q is true
    (c) Both P and Q are true (d) Neither P nor Q is true

    17 The number of bounded regions in and respectively b 2

    (a) 2, n+1 (b) 1, n (c) n, n (d) 2,n

    18 Which one the following graph is non planar. c 2

    (b) (c) and

    19 In order to find shortest path from vertex a to j , if the node “ c” is closed with c 2

    15 unit .then which node is going to be closed next

    (a) Node- d (b) Node- g (c)Node- f (b) Node- h

    20 The number of Cut edges in the a 2

    (a) 0 (b) 100 (c) 101 (d) 50


    sr. Question Key M
    no.
    1 c 1
    in W50

    (b) 50 (b) 51 (c) 200 (d)100

    2 Every cyclic graph with n vertices can be drawn in without any edge crossing d 1

    if

    (a)
    (b)
    (c)
    (d) n can be any Positive integer

    3 Consider the following statements c 1

    P: Every Cube graph with n vertices is n regular


    Q: Every Kn,n graph is n-regular. Then

    (e) Only P is true


    (f) Only Q is true
    (g) Both P and Q are true
    (h) Neither P nor Q is true

    4 Let G be a simple undirected graph with 20 vertices and it’s not a complete d 1

    one then how many vertices are there in

    (b) 5 (b) 10 (c) 25 (d) 20


    5 Let G be a simple undirected graph with 15 vertices and 100 edges then how d 1

    many edges are there in

    (a) 145 (b) 190 (c) 125 (d) 90


    6 The value of n such that is isomorphic to its complement c 1

    (b) 3 (b) 4 (c) 5 (d) 6

    7 is bipartite for which one the following value b 1

    (a)3 (b) 4 (c) 5 (d) 7


    8 Total number of edges in W20 b 1

    (b) 5 (b) 21 (c) 15 (d) 20

    9 The wheel graph with n vertices is regular if n= a 1

    (b) 3 (b) 4 (c) 5 (d) any natural number

    10 The number of edges in d 1

    (a) 8 (b) 6 (c) 16 (d) 12

    11 C 2
    in K90, 60
    (a) 5400 (b) 150 (c)10800 (d)10000

    12 The chromatic number of K15 c 2

    (a) 5 (b) 10 (c) 15 (d) 20

    13 The chromatic number of b 2

    (a) 100 (b) 2 (c) 3 (d) 4

    14 The chromatic number of W101 d 2

    (a) 100 (b) 2 (c) 3 (d) 4

    15 Consider the following statements c 2

    P: The chromatic number of is 2

    Q: The chromatic number of is 2

    Then

    (e) Only P is true


    (f) Only Q is true
    (g) Both P and Q are true
    (h) Neither P nor Q is true
    16 Consider the following statements c 2

    P: The number of cut vertices in C3 is 0


    Q: The number of cut edges in C4 is 0
    Then
    (b) Only P is true (b) Only Q is true
    (c) Both P and Q are true (d) Neither P nor Q is true

    17 The number of bounded regions in and its complement respectively d 2

    (a) 2, 1 (b) 1, 2 (c) 3, 2 (d) 2,2

    18 Which one the following graph is bipartite . d 2

    (b) (c) (d) C6

    19 In order to find shortest path from vertex a to j , if the node “ c” is closed with c 2

    15 unit .then which node is going to be closed next

    (b) Node- d (b) Node- g (c)Node- f (b) Node- h

    20 The number of Cut edges in the a 2

    (a) 0 (b) 100 (c) 101 (d) 50

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy