Scribd Logo
Upload

Welcome to Scribd!

  • Advanced Graph Theory Quiz-01: Dr. Muhammad Kamran Jamil Kamran - Jamil@riphah - Edu.pk Spring, 2020

    Uploaded by

    Anam Bilqees
    23 views1 page
    This document provides instructions for an advanced graph theory quiz. It states that the quiz is worth 10 total marks, must not be identical to others' work, must be submitted through specific platforms, and allows 15 minutes to complete. The single exercise asks students to prove that in a connected graph where the number of edges is greater than or equal to the number of vertices, the graph must contain a cycle.

    Original Description:

    Original Title

    asdjjf.pdf

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document provides instructions for an advanced graph theory quiz. It states that the quiz is worth 10 total marks, must not be identical to others' work, must be submitted through specific platforms, and allows 15 minutes to complete. The single exercise asks students to prove that in a connected graph where the number of edges is greater than or equal to the number of vertices, the graph must contain a cycle.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    23 views1 page

    Advanced Graph Theory Quiz-01: Dr. Muhammad Kamran Jamil Kamran - Jamil@riphah - Edu.pk Spring, 2020

    Uploaded by

    Anam Bilqees
    This document provides instructions for an advanced graph theory quiz. It states that the quiz is worth 10 total marks, must not be identical to others' work, must be submitted through specific platforms, and allows 15 minutes to complete. The single exercise asks students to prove that in a connected graph where the number of edges is greater than or equal to the number of vertices, the graph must contain a cycle.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    Advanced Graph Theory Quiz-01

    Dr. Muhammad Kamran Jamil


    kamran.jamil@riphah.edu.pk
    Spring, 2020

    Instructions
    1. Total marks = 10

    2. Identical/copied quiz will be marked zero.


    3. Quiz should be submitted through Moellim or Microsoft Teams.
    4. Time allowed 15 Minutes.

    Exercise 1.
    Prove that in a connected graph G if number of edges is greater or equal to number of vertices than G has a cycle.

    You might also like