Help shape GoConqr. What should we add next?

Discrete Mathematics, Graph Theory and Decision Maths

218 resources created by 160 users

This Discrete Mathematics, Graph Theory and Decision Maths page on GoConqr gathers community-made flashcards, mind maps, quizzes, notes and slides, from graph theory terms and critical path analysis to linear programming and game theory. It's built for university students and professional candidates, school students, and teachers after ready-made material. There are over 200 resources here, including more than 60 mind maps and over 100 flashcard decks, made by over 150 contributors. Pick a topic, try a quiz to find your gaps, then build your own set.

Select topic

Top Discrete Mathematics, Graph Theory and Decision Maths resources

Flowcharts

Slides

Topics in Discrete Mathematics, Graph Theory and Decision Maths

More Mathematics topics

About Discrete Mathematics, Graph Theory and Decision Maths

GoConqr Original

What this page covers

This page brings together material on graphs, networks and decision methods. Many resources follow the Edexcel D1 decision mathematics course, while others come from university discrete mathematics courses. You will find flashcards, mind maps, notes, slide sets, flowcharts and a small set of quizzes.

Where to start

Begin with vocabulary. The Graph Theory flashcard decks define terms such as degree, connected graph, simple graph and network. D1 Definitions covers Bubble Sort, Quick Sort, Binary Search and bin packing. D1 Graph/ Network Rules adds rules such as how many odd nodes a graph can have.

Then move to the mind maps. The Graph Theory mind map lays out walks, trails, paths, bipartite graphs, subgraphs and isomorphisms in one view. The Discrete Mathematics mind map is wider, reaching logic, sets and applications in computing.

Methods and algorithms

  • Critical path analysis flashcards ask what a precedence table is and how to draw an activity network.
  • Kruskal's Algorithm is a slide set on finding a minimum spanning tree by adding arcs in order of weight without making a cycle.
  • The Travelling Salesman Problem deck covers Hamiltonian cycles and the nearest neighbor algorithm.
  • The flowchart for First Fit and First Fit Decreasing shows bin packing step by step.
  • Notes and slides on linear programming, including the simplex tableau, cover optimization.

Using quizzes and maps together

Read a mind map first, then close it and try a quiz such as the Graph Theory quiz. Note every question you miss, find the matching flashcard deck and go through it again. After that, retake the quiz and see what has changed.

Where this sits

This unit belongs to the strand Logic, Sets and Discrete Mathematics, within Mathematics. It suits university students who need discrete mathematics and school students working on A-level decision mathematics. Choose one deck or map that matches your course, and then make your own flashcards for the gaps you find.

Frequently asked questions

Which resource should I open first?

Start with a Graph Theory flashcard deck if the terms are new. It defines graph, degree, connected graph and network in short cards. Once those feel familiar, open the Graph Theory mind map to see walks, trails, paths and bipartite graphs laid out together, then test yourself with the Graph Theory quiz.

Are there resources for A-level decision mathematics?

Yes. Several flashcard decks and mind maps follow the Edexcel D1 course, with titles such as D1 Definitions, Decision 1 and D1 Graph/ Network Rules. They cover keywords, graph rules, sorting, bin packing and linear programming. They suit school students preparing for an exam, and others may find them useful too.

What do the mind maps cover?

There are more than 60 mind maps. Some outline graph theory terms like subgraphs, vertex degrees and connected graphs. Others cover broad discrete mathematics, game theory, recurrence relations, the pigeonhole principle and linear programming. Pick one for an overview, then move to flashcards or quizzes for detail.

Are the resources free to use?

Yes. Every resource listed here is free to open, study and take, with no account needed. They were made by GoConqr users, not by GoConqr itself. A free account also saves your quiz scores and lets you make your own quizzes, mind maps, flashcards and notes.

Is there anything on algorithms and optimization?

Yes. You can find a Kruskal's Algorithm slide set, a flowchart for First Fit and First Fit Decreasing, and flashcards on critical path analysis and the Travelling Salesman Problem. There are also notes on linear programming and the simplex tableau, plus slides with practice questions.

What if I cannot find my exact topic?

Try a nearby title. Graph topics appear under names like Graphs, Networks and Decision Graph Theory, and the same idea may be worded differently. If nothing fits, you can make your own flashcards or mind map on the topic.

Feedback

What is it about?

What should we add next?