PhD (Graph Theory)
Advance knowledge in graph theory and network science PhD Graph Theory Explore distance education options new syllabus subjects.
Course Overview
PhD (Graph Theory)
PhD in Graph Theory: A Doctor of Philosophy (PhD) in Graph Theory is an advanced academic degree that focuses on the study of graphs, which are mathematical structures used to model pairwise relations between objects. In this specialized field, students conduct research to advance the understanding of graph theory, develop new algorithms, and solve complex problems related to networks and connections. The program typically involves coursework, comprehensive exams, original research, and a dissertation defense.
Graph Theory
Graph theory is a branch of mathematics that deals with the study of graphs, which are mathematical structures used to model pairwise relations between objects. Graphs consist of vertices (nodes) connected by edges (lines), and graph theory explores various properties and applications of these structures.
Eligibility Criteria for PhD in Graph Theory in India
Educational Qualifications: A Master's degree in Mathematics or a related field.
Minimum Marks: Typically, candidates should have a minimum of 55% to 60% aggregate marks in their postgraduate studies.
Entrance Exams: Candidates may need to clear entrance exams like UGC NET, CSIR NET, GATE, or university-specific entrance exams.
Merit-Based Selection: Selection may also be based on the candidate's performance in the entrance exam and/or interview.
Age Limit: There is usually no specific age limit for PhD admissions, but some universities may have age restrictions.
Nationality: Indian nationals as well as foreign nationals are eligible to apply.
Specific Requirements: Proficiency in programming languages like Python, good knowledge of graph theory, strong mathematical background, and research experience may be desired.
Note: It is advisable to check the specific eligibility criteria of the university or institution where you wish to pursue your PhD in Graph Theory.