Scribd Logo
Încărcați

Bine ați venit la Scribd!

  • Amity Assignment Basic MathemaTICS ... 1ST SEM

    Încărcat de

    Kumar Sandeep
    155 vizualizări6 pagini
    The document contains 5 multiple choice questions about graphs. Question 1 asks about the definition of a tree in a graph. Question 2 is about the parity of the number of nodes with odd degree in an undirected graph. Question 3 asks about the components of a graph. Question 4 concerns the maximum number of edges a graph can have before having a parallel edge or self loop. Question 5 is about a graph with one vertex and no edges.

    Descriere originală:

    math

    Titlu original

    Amity Assignment Basic MathemaTICS ...1ST SEM

    Drepturi de autor

    © © All Rights Reserved

    Formate disponibile

    DOCX, PDF, TXT sau citiți online pe Scribd

    Vi se pare util acest document?

    Este necorespunzător acest conținut?

    Raportați acest document
    The document contains 5 multiple choice questions about graphs. Question 1 asks about the definition of a tree in a graph. Question 2 is about the parity of the number of nodes with odd degree in an undirected graph. Question 3 asks about the components of a graph. Question 4 concerns the maximum number of edges a graph can have before having a parallel edge or self loop. Question 5 is about a graph with one vertex and no edges.

    Drepturi de autor:

    © All Rights Reserved
    Descărcați ca DOCX, PDF, TXT sau citiți online pe Scribd
    Indicator pentru conținut neadecvat
    155 vizualizări6 pagini

    Amity Assignment Basic MathemaTICS ... 1ST SEM

    Încărcat de

    Kumar Sandeep
    The document contains 5 multiple choice questions about graphs. Question 1 asks about the definition of a tree in a graph. Question 2 is about the parity of the number of nodes with odd degree in an undirected graph. Question 3 asks about the components of a graph. Question 4 concerns the maximum number of edges a graph can have before having a parallel edge or self loop. Question 5 is about a graph with one vertex and no edges.

    Drepturi de autor:

    © All Rights Reserved
    Descărcați ca DOCX, PDF, TXT sau citiți online pe Scribd
    Indicator pentru conținut neadecvat
    din 6

    AssignmentA

    AssignmentB

    AssignmentC

    Question No. 1

    A graph G is called a .....if it is a connected acyclic graph


    Options

    Cyclic graph
    Regular graph
    Tree
    not a graph

    Question No. 2

    In an undirected graph the number of nodes with odd degree must be :


    Options

    Zero
    Odd
    Prime

    Even

    Question No. 3

    A graph is a collection of :
    Options

    Row and columns


    Vertices and edges
    Equations
    degrees

    Question No. 4

    A graph with n vertices will definitely have a parallel edge or self loop if the total number of edges are :
    Options

    greater than n1
    less than n(n1)
    greater than n(n1)/2
    less than n2/2

    Question No. 5

    A graph with one vertex and no edges is :


    Options

    S-ar putea să vă placă și