Stuck in Tutorial Hell? Learn Backend Dev the Right Way
Google Data Analytics, IBM AI & Meta Marketing — All in One Subscription
Overview
Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Explore the fascinating world of graph theory in this 34-minute video lecture on the Graceful Tree Conjecture. Delve into basic graph theory terminology, learn about graceful and non-graceful graphs, and examine evidence supporting the conjecture. Discover the Ringel-Kotzig conjecture's origins and its connection to vertex labellings introduced by A. Rosa in 1967. Engage with numerous exercises to investigate graceful labellings and gain insight into the important Coxeter Dynkin diagrams. Follow along as the lecture progresses through graph and tree terminology, graph labelling techniques, graceful labellings, and examples of graceful graphs before concluding with a discussion on the evidence supporting the Graceful Tree Conjecture.
Syllabus
Introduction
Graphs and trees terminology
Labelling of a graph
Graceful labellings
Graceful graphs
Evidence for the Graceful Tree Conjecture
Taught by
Insights into Mathematics