Scribd
Upload
26 views2 pages

Graph TH 2

Gr

Uploaded by

rmpathakmaths
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
26 views2 pages

Graph TH 2

Gr

Uploaded by

rmpathakmaths
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

26

9. William Stalling; Cryptology and network security.

Course: Graph Theory and Combinatorics (Elective C)


Course Code: USMT6C4 /UAMT6C4

Unit I: Colorings of graph (15L)

Vertex coloring- evaluation of vertex chromatic number of some standard graphs, critical graph.
Upper and lower bounds of Vertex chromatic Number- Statement of Brooks theorem. Edge
colouring- Evaluation of edge chromatic number of standard graphs such as complete graph,
complete bipartite graph, cycle. Statement of Vizing Theorem. Chromatic polynomial of graphs-
Recurrence Relation and properties of Chromatic polynomials. Vertex and edge cuts, vertex and
edge connectivity and the relation between vertex and edge connectivity. Equality of vertex and
edge connectivity of cubic graphs. Whitney’s theorem on 2-vertex connected graphs.

Unit II: Planar graph (15L)

Definition of planar graph. Euler formula and its consequences. Non planarity of K5 ; K( 3; 3).
Dual of a graph. Polyhedran in R3 and existence of exactly five regular polyhedron- (Platonic
solids) Colorabilty of planar graphs- 5 color theorem for planar graphs, statement of 4 color
theorem. flows in Networks, and cut in a network- value of a flow and the capacity of cut in a
network, relation between flow and cut. Maximal flow and minimal cut in a network and Ford-
Fulkerson theorem.

Unit III: Combinatorics (15L)

Applications of Inclusion Exclusion Principle- Rook polynomial, Forbidden position problems.


Introduction to partial fractions and Newton’s binomial theorem for real power series, series
expansion of some standard functions. Forming recurrence relation and getting a generating
function. Solving a recurrence relation using ordinary generating functions. System of Distinct
Representatives and Hall’s theorem of SDR.

Recommended Books.

1. Bondy and Murty; Grapgh Theory with Applications.

2. Balkrishnan and Ranganathan; Graph theory and applications.

3. Douglas B. West, Introduction to Graph Theory, 2nd Ed., Pearson, 2000

4. Richard Brualdi; Introduction to Combinatorics.

Additional Reference Book.

1. Behzad and Chartrand; Graph theory.

2. Choudam S. A.; Introductory Graph theory; 3 Cohen, Combinatorics.


29

6 Solve one dimensional heat and wave equation using Laplace transform. Solve initial and
boundary value problems using Fourier transform.

7 Miscellaneous Theory Questions.

Suggested Practicals based on USMT6B4 / UAMT6B4

1 Legendre Symbol.

2 Jacobi Symbol and Quadratic congruences with composite moduli.

3 Finite continued fractions.

4 Infinite continued fractions.

5 Pell’s equations and Arithmetic functions of number theory.

6 Special Numbers.

7 Miscellaneous Theoretical questions.

Suggested Practicals based on USMT6C4 / UAMT6C4

1 Coloring of Graphs

2 Chromatic polynomials and connectivity.

3 Planar graphs

4 Flow theory.

5 Application of Inclusion Exclusion Principle, rook polynomial. Recurrence relation.

6 Generating function and SDR.

7 Miscellaneous theoretical questions.

Suggested Practicals based on USMT6D4 / UAMT6D4


All practicals to be done manually as well as using software TORA / EXCEL solver.

1 LPP formation, graphical method and simple problems on theory of simplex method

2 LPP Simplex Method

3 Big-M method, special cases of solutions.

4 Transportation Problem

5 Queuing Theory; single server models

6 Queuing Theory; multiple server models

7 Miscellaneous Theory Questions.

XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

You might also like