An Introduction to Graph Theory
Learning Outcome
- Understand crucial concepts of Graph Theory.
- Learn about various graphs and their properties.
- Deepen your knowledge on graph colouring.
- Develop an in-depth understanding of Eulerian and Hamiltonian paths and circuits and other related topics to paths.
- PERFORM elementary and advanced operations on graphs to create a new graph.
Description
The An Introduction to Graph Theory is the best way for you to gain deep insight and knowledge of this topic. You will learn from industry experts and obtain an accredited certificate after completing the course. Enrol now for a limited-time discounted price.
Like all the courses of Thames College, this An Introduction to Graph Theory is designed with the utmost attention and thorough research. All the topics are broken down into easy to understand bite-sized modules that help our learners to understand each lesson very easily.
We don’t just provide courses at Thames College; we provide a rich learning experience. After purchasing a course from Thames College, you get complete 1-year access with tutor support.
Our expert instructors are always available to answer all your questions and make your learning experience exquisite.
After completing the An Introduction to Graph Theory, you will instantly get an e-certificate that will help you get jobs in the relevant field and will enrich your CV.
If you want to learn about this topic and achieve certifications, you should consider this An Introduction to Graph Theory from Thames College.
There are no hidden fees or exam charges. We are very upfront and clear about all the costs of the course.
Course design
The course is delivered through our online learning platform, accessible through any internet-connected device. There are no formal deadlines or teaching schedules, meaning you are free to study the course at your own pace.
You are taught through a combination of
- Video lessons
- Online study materials
Will I receive a certificate of completion?
Upon successful completion, you will qualify for the UK and internationally-recognised certification and you can choose to make your achievement formal by obtaining your PDF Certificate at a cost of £9 and Hard Copy Certificate for £15.
Why study this course
Whether you’re an existing practitioner or aspiring professional, this course will enhance your expertise and boost your CV with key skills and an accredited qualification attesting to your knowledge.
The An Introduction to Graph Theory is open to all, with no formal entry requirements. All you need is a passion for learning, a good understanding of the English language, numeracy and IT, and to be over the age of 16.
Course Curriculum
| Course Promo | |||
| Graph Theory Promo | 00:02:00 | ||
| Module 01: Supplements | |||
| Textbook Recommendations | 00:02:00 | ||
| Tools and Softwares | 00:05:00 | ||
| Sets | 00:09:00 | ||
| Number Sets | 00:10:00 | ||
| Parity | 00:12:00 | ||
| Terminologies | 00:07:00 | ||
| Module 02: Fundamentals | |||
| Introduction | 00:03:00 | ||
| Graphs | 00:11:00 | ||
| Subgraphs | 00:09:00 | ||
| Degree | 00:10:00 | ||
| Sum of Degrees of Vertices Theorem | 00:23:00 | ||
| Adjacency and Incidence | 00:09:00 | ||
| Adjacency Matrix | 00:16:00 | ||
| Incidence Matrix | 00:08:00 | ||
| Isomorphism | 00:08:00 | ||
| Module 03: Paths | |||
| Introduction | 00:01:00 | ||
| Walks, Trails, Paths, and Circuits | 00:13:00 | ||
| Examples | 00:10:00 | ||
| Eccentricity, Diameter, and Radius | 00:07:00 | ||
| Connectedness | 00:20:00 | ||
| Euler Trails and Circuits | 00:18:00 | ||
| Fleury’s Algorithm | 00:10:00 | ||
| Hamiltonian Paths and Circuits | 00:06:00 | ||
| Ore’s Theorem | 00:14:00 | ||
| Dirac’s Theorem | 00:06:00 | ||
| The Shortest Path Problem | 00:16:00 | ||
| Module 04: Graph Types | |||
| Introduction | 00:01:00 | ||
| Trivial, Null and Simple Graphs | 00:10:00 | ||
| Regular Graphs | 00:10:00 | ||
| Complete, Cycles and Cubic Graphs | 00:10:00 | ||
| Path, Wheel and Platonic Graphs | 00:11:00 | ||
| Bipartite Graphs | 00:14:00 | ||
| Module 05: Trees | |||
| Introduction | 00:01:00 | ||
| Trees | 00:14:00 | ||
| Cayley’s Theorem | 00:03:00 | ||
| Rooted Trees | 00:10:00 | ||
| Binary Trees | 00:14:00 | ||
| Binary Tree Traversals | 00:18:00 | ||
| Binary Expression Trees | 00:09:00 | ||
| Binary Search Trees | 00:19:00 | ||
| Spanning Trees | 00:10:00 | ||
| Forest | 00:07:00 | ||
| Module 06: Digraphs and Tournaments | |||
| Introduction | 00:01:00 | ||
| Digraphs | 00:12:00 | ||
| Degree | 00:09:00 | ||
| Isomorphism | 00:08:00 | ||
| Adjacency Matrix | 00:10:00 | ||
| Incidence Matrix | 00:05:00 | ||
| Walks, Paths and Cycles | 00:12:00 | ||
| Connectedness | 00:05:00 | ||
| Tournaments | 00:08:00 | ||
| Module 07: Planar Graphs | |||
| Introduction | 00:01:00 | ||
| Planar Graphs | 00:10:00 | ||
| Kuratowski’s Theorem | 00:14:00 | ||
| Euler’s Formula | 00:10:00 | ||
| Dual Graphs | 00:11:00 | ||
| Module 08: Graph Operations | |||
| Introduction | 00:01:00 | ||
| Vertex and Edge Deletion & Addition | 00:08:00 | ||
| Cartesian Product | 00:10:00 | ||
| Graph Join and Transpose | 00:04:00 | ||
| Complement Graphs | 00:05:00 | ||
| Module 09: Graph Colourings | |||
| Introduction | 00:01:00 | ||
| Vertex Colourings | 00:05:00 | ||
| Edge Colourings | 00:09:00 | ||
| Total Colourings | 00:05:00 | ||
| Assignment | |||
| Assignment – An Introduction to Graph Theory | 00:00:00 | ||
Certificate of Achievement
CPD Accredited Certification
Certification is available –
- In PDF for £2.99
- Hard copy for £8.99
Course Reviews
No Reviews found for this course.
Access
Level
Number of Units
Number of Quizzes
Duration