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
- Logic, Proofs and Boolean Algebra6
- Sets, Relations and Functions17
- Combinatorics and Recurrence Relations5
- Sorting, Searching and Bin Packing Algorithms6
- Graph Terminology and Types36
- Graph Paths, Cycles and Route Problems11
- Planar Graphs and Graph Coloring5
- Trees and Minimum Spanning Trees9
- Graph and Network Algorithms23
- Linear Programming15
- Constrained Optimization and Lagrange Multipliers6
- Game Theory13
Top Discrete Mathematics, Graph Theory and Decision Maths resources
-
13 cardsCritical path analysis What is a precedence table?
-
28 nodesDiscrete Mathematics Topics · Applications
-
18 cardsD1 Graph/ Network Rules
-
9 cardsD1 Definitions Definitions for Algotirthim Chapters Edexcel Exam Board
-
26 nodesGraph Theory Terminology · Isomorphisms of Graphs · Subgraphs · Vertex Degrees · Walks, Trails and Paths · Graph Components
-
D1 Flowchart - Intructions for First Fit and First Fit Decreasing D1 First Fit Algorithm · Take the values in ... · place the next box ... · Calculate the lower...
-
19 cardsD1 maths definitions The degree/valency/order of a vertex
-
122 cardsGame Theory Strategic or non-cooperative games Coalitional or cooperative games
Quizzes
See all 10 quizzes-
105 questionsTomorrow's Quiz How many strings of five English letters that are start with B are there if letters can be repeated?
-
39 questionsStochastic optimization algorithms A mathematical function f(x) has always only one global minimum.
-
38 questionsDM38 - 75 Rewrite the statement so that negations appear only within predicates (that is, so that no negation is outs...
-
12 questionsWeek 5 Practice Quiz A very special farmer has 100 acres of land available for which he can plant either tomanas (a hybrid banan...
-
10 questionsGraph Theory "All cycle' s are paths, but not all paths are cycles"
-
11 questionsdefinitions what is a graph called that has no edges crossing?
-
4 questionsLarange multiplier
-
12 questionsCIS 1910 - Quiz 8 - W19
Mind maps
See all 68 mind maps-
28 nodesDiscrete Mathematics Topics · Applications
-
26 nodesGraph Theory Terminology · Isomorphisms of Graphs · Subgraphs · Vertex Degrees · Walks, Trails and Paths · Graph Components
-
226 nodesSix Concepts of Discrete Mathematics Sets Theory · Logic and Proofs · Relations · Graphs · Number Theory · Function
-
189 nodesDiscrete Maths Proofs · Numbers · Sets · Formal Languages and ...
-
180 nodesSix Concepts of Discrete Mathematics Sets Theory · Logic and Proofs · Relations · Graphs · Number Theory · Function
-
24 nodesThe Central Role of Discrete Mathematics in the Context of Information Technology and Communications Alexa María López Agu... · Discrete Mathematics ... · classical and fuzzy l... · APPLICATIONS IN IT&C · The formal language t... · A. Some applications ...
-
66 nodesD1 Revision Graphs and Networks · Algorithms · Linear Programming
-
50 nodesGraphs & Networks Deffinitions · Types of graphs · Alternate ways of rep... · Alternate way of repr... · Minimum connector alg...
Flashcards
See all 111 flashcards-
13 cardsCritical path analysis What is a precedence table?
-
18 cardsD1 Graph/ Network Rules
-
9 cardsD1 Definitions Definitions for Algotirthim Chapters Edexcel Exam Board
-
19 cardsD1 maths definitions The degree/valency/order of a vertex
-
122 cardsGame Theory Strategic or non-cooperative games Coalitional or cooperative games
-
24 cardsGraph Theory
-
13 cardsTravelling Salesman Problem For a complete graph with n vertices, how do we work out the number of of Hamiltonian cycles?
-
21 cardsGraph Theory What does a graph consist of?
Flowcharts
-
D1 Flowchart - Intructions for First Fit and First Fit Decreasing D1 First Fit Algorithm · Take the values in ... · place the next box ... · Calculate the lower...
-
Untitled SEMIGROUP · If a finite o... · Closure · Associative
-
Untitled Discrete Mathematics · Main topics&n... · *Classical a...
Notes
See all 18 notes-
Mathematics: Decision 1 (Notes 1 of 1) An algorithm is a set of instructions for solving a problem. The order of an algorithm tells you how 'efficient' an algorithm is. It tells you how the time the algorithm takes to run changes as the number of input val...
-
Summary of Chapter 1 1 Algorithms can be given in words or flowcharts.2 Unordered lists can be sorted using a bubble sort or a quick sort.3 In a bubble sort, you compare adjacent items in a list. If they are in order, ...
-
Summary of Chapter 2 1 A graph consists of vertices(nodes) which are connected by edges(arcs). 2 A subgraph is part of a graph. 3 If a graph has a number associated with each edge (its weight) then the graph is a weighted graph (network)....
-
Linear Programming Linear ProgrammingIn this topic we look at maximising profits or minimising costs subject to constraints.Formulating the Problem-Decision Variables: the qualities to be decided-Objective Function: profit/cost to be ma...
-
D1 Section 1 Algorithm Flow ChartsRemeber to take your time and follow the chart exactly, reading all of the boxes each time. Lower Boundgives the minimum Number of Bins needed add up the height/weight (etc.) of the items and divi...
-
Section 2 A graph is made up of points (nodes/vertices) joined by lines (edges/arcs). Weighted Graphs/Networks have a number on Each Arc Digraphs/Directed Graphs have Directed Edges
-
Linear Programming Critical Path AnalysisKey TermsObjective function- the maximising or minimising inequality that involves money e.g. profit, cost, revenueDecision variables- numbers of each things that can be varied (variables), varia...
-
cs 6.042 Lecture 10 : Hamiltonian path : path where every node is visited only once. Tournament Graph: an edge from one node to other basically mean that a given vertex has beaten othe...
Slides
Topics in Discrete Mathematics, Graph Theory and Decision Maths
More Mathematics topics
About Discrete Mathematics, Graph Theory and Decision Maths
GoConqr OriginalWhat 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.