M.Phil/Ph.

D Part I II (A)
ACHARYA NAGARJUNA UNIVERSITY::NAGARJUNA NAGAR-522 510
DEPARTMENT OF MATHEMATICS
M. Phil/Ph.D Part-1 Examination Syllabus (w.e.f.01-01-2014)
Paper-II (A): SPECIAL FUNCTIONS AND GRAPH THEORY
Unit-I
The Hypergeometric Function: The function F(a,b;c;z), A simple integral form, F(a,b;c;1) as a
function of the parameters, Evaluation of F(a,b;c;1), Contiguous function relations, The
hypergeometric differential equation , F(a,b;c;z), as a function of its parameters, Elementary series
manipulations, Simple transformations, Relation between functions of z and 1-z,
[CH- 4 of 1]
The Generalized Hypergeometric Functions: The function p Fq , The exponential and binomial
functions, A differential equation, Other solutions of the differential equation, The contiguous
function relations, A simple integral, The p Fq with unit argument, Saalschutz theorem, Wipples
theorem, Dixons theorem, Contour integrals of Barnes type, The Barnes integrals and the function
p Fq , [CH- 5 of 1]
Unit-II
H
(x
)
Hermite Polynomials: Definition of
, Recurrence relations, The Rodrigues formula, Other
n
generating functions, Integrals, Orthogonality, Expansion of polynomials, More generating functions.
[CH- 11 of 1 and relevant articles as in 6.1 to 6.8 of CH-6 of 2]

Laguerre Polynomial: The Polynomial Ln (x ) , Generating functions, Recurrence relations, The

Rodrigues formula, The differential equation, Orthogonality, Expansion of Polynomials, Special
properties, Other generating functions.[CH- 12 of 1 and relevant articles as in 7.11 to 7.16]
Unit-III
Fundamental Concepts: What is a Graph? - The Definition - Graphs as Models -Matrices and
Isomorphism - Decomposition and Special Graphs - Paths, Cycles and Trails - Connection in Graphs
- Bipartite Graphs - Eulerian Circuits - Vertex Degrees and Counting - Counting and Bijections Extremal Problems - Graphic Sequences. Directed Graphs - Definitions and Examples - Vertex
Degrees - Eulerian Digraphs-Orientations and Tournaments {CH-1 of 3].
Matchings and Factors: Matchings and Covers Maximum Matchings Halls Matching Condition
Min Max Theorems Independent Sets and Covers Dominating Sets (optional) Algorithms and
Applications Maximum Bipartite Matching Stable Matchings (optional) Faster Bipartite
Matching (optional). Matchings in General Graphs Tuttes 1-factor Theorem f-factors of Graphs
(optional) Edmonds Blossom Algorithm (optional) [CH-3 of 3]
Unit-IV
Coloring of Graphs: Vertex Colorings and Upper Bounds Definitions and Examples Upper
Bounds Brooks Theorm - Structure of k-chromatic Graphs Graphs with Large Chromatic
Number Extremal Problems and Turans Theorem ColorCritical Graphs - Forced Subdivisions
Enumerative Aspects Counting Proper Colorings Chordal Graphs A Hint of perfect Graphs
Counting Acyclic Orientations (optional) [CH- 5 of 3].
References
[1]. Special Functions by Earl D. Rainville, Chelsea Publishing Company,New York.
[2]. Special Functions by J.N.Sharma and R.K.Gupta, Krishna Prakashan Media (P) Ltd.,
Meerut.
[3]. Introduction to Graph Theory by Douglas B. West, Second Edition, Prentice-Hall of
India, New Delhi,2002.