Scribd Logo
Upload

Welcome to Scribd!

  • 314 views

    NE9223 - Graph Theory

    Uploaded by

    sendhil28
    This document outlines the units and topics covered in a graph theory course. The five units are: I) introduction to graphs, trees, and distances; II) matching, connectivity, and network flows; III) graph colouring; IV) planar graphs, edges, and cycles; and V) Ramsey theory and random graphs. Some specific topics include paths, cycles, vertex degrees, directed graphs, spanning trees, matching algorithms, connectivity, network flows, vertex colouring, planar graph embeddings, and properties of random graphs. The course is worth 45 periods and references several graph theory textbooks.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd

    NE9223 - Graph Theory

    Uploaded by

    sendhil28
    314 views1 page
    This document outlines the units and topics covered in a graph theory course. The five units are: I) introduction to graphs, trees, and distances; II) matching, connectivity, and network flows; III) graph colouring; IV) planar graphs, edges, and cycles; and V) Ramsey theory and random graphs. Some specific topics include paths, cycles, vertex degrees, directed graphs, spanning trees, matching algorithms, connectivity, network flows, vertex colouring, planar graph embeddings, and properties of random graphs. The course is worth 45 periods and references several graph theory textbooks.

    Original Description:

    Syllabus for ME Network

    Original Title

    NE9223_ Graph Theory

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document outlines the units and topics covered in a graph theory course. The five units are: I) introduction to graphs, trees, and distances; II) matching, connectivity, and network flows; III) graph colouring; IV) planar graphs, edges, and cycles; and V) Ramsey theory and random graphs. Some specific topics include paths, cycles, vertex degrees, directed graphs, spanning trees, matching algorithms, connectivity, network flows, vertex colouring, planar graph embeddings, and properties of random graphs. The course is worth 45 periods and references several graph theory textbooks.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    314 views1 page

    NE9223 - Graph Theory

    Uploaded by

    sendhil28
    This document outlines the units and topics covered in a graph theory course. The five units are: I) introduction to graphs, trees, and distances; II) matching, connectivity, and network flows; III) graph colouring; IV) planar graphs, edges, and cycles; and V) Ramsey theory and random graphs. Some specific topics include paths, cycles, vertex degrees, directed graphs, spanning trees, matching algorithms, connectivity, network flows, vertex colouring, planar graph embeddings, and properties of random graphs. The course is worth 45 periods and references several graph theory textbooks.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 1

    NE9223 GRAPH THEORY UNIT I INTRODUCTION

    LT P C

    3003 9

    Introduction Of Graphs, Paths, Cycles, And Trails, Vertex Degrees And Counting - Directed Graphs - Trees and Distance: Basic Properties. Spanning Trees and Enumeration, Optimization and Trees. UNIT II MATCHING CONNECTIVITY AND FLOW 9

    Matching and Covers Algorithms and Applications. Matching in General Graphs. - Connectivity and Paths: Cuts and Connectivity, k-connected graphs - Network Flow Problems. UNIT III COLOURING 9

    Vertex Colourings and Upper Bounds - Structure of k-chromatic Graphs, Enumerative Aspects. UNIT IV PLANAR GRAPHS, EDGES AND CYCLES 9

    Planar Graphs - Embeddings and Eulers Formula - Characterization of Planar graphs - arameters of Planarity, Line Graphs and Edge-Colouring, Hamiltonian Cycles, Planarity, Colouring and cycles. UNIT V RAMSEY THEORY AND RANDOM GRAPHS 9

    Ramsey Theory for Graphs: Ramseys Theorems - Ramsey numbers -Induced Ramsey theorems - Ramsey Properties and Connectivity. Random Graphs: The notion of a random graph - The Probabilistic method - Properties of almost all graphs - Threshold functions and second moments TOTAL: 45 PERIODS REFERNCES 1. R J Wilson Introduction to Graph Theory , 4th Edition, Pearson Education 2003. 2. Reinhard Diestel Graph Theory ,, 2nd Edition, Springer- Verlog 2000, 3. Jay Yellen, Jonathan L.Gross Graph Theory and Its Applications ,CRC Press LLC 1998. 4. Bela Bollobas Modern Graph Theory, Springer Verlag, July 1998. 5. Wilson Introduction to Graph Theory, 2nd edition, Pearson Education India

    You might also like