Discrete Mathematics Graph Theory & Combinatorics | BMLabs | BMLabs Mathematics

Subject knowledge map

Learning structure

Explore every published chapter, section, and lesson in this subject through one keyboard-accessible visual hierarchy.

Interactive concept atlas

Discrete Mathematics Learning Map

191 concepts · 190 relationships · auto mode

Concept map ready to load

The graph engine loads only when this learning map approaches the viewport.

Accessible text outline

Concepts

Discrete Mathematicssubject
Introduction To Discrete Mathematicschapter
What is a Graphsection
Applications of Graphssection
Finite and Infinite Graphssection
Incidence and Degreesection
Types of Vertices and Special Graphssection
History of Graph Theorysection
Paths and Circuitschapter
Graph Isomorphismsection
Subgraphssection
Graph-Based Puzzlessection
Walks Paths and Circuitssection
Connected and Disconnected Graphssection
Euler Graphssection
Graph Operationssection
Advanced Euler Graphssection
Hamiltonian Paths and Circuitssection
Traveling Salesman Problemsection
Trees and Fundamental Circuitschapter
Treessection
Properties of Treessection
Pendant Vertices in Treessection
Distance and Centers in Treessection
Rooted and Binary Treessection
Counting Treessection
Spanning Treessection
Fundamental Circuitssection
Enumeration of Spanning Treessection
Minimum Spanning Treessection
Cut-Sets and Cut-Verticeschapter
Cut-Setssection
Properties of Cut-Setssection
Enumeration of Cut-Setssection
Circuits and Cut-Set Relationssection
Connectivity and Separabilitysection
Network Flow Basicssection
Graph Isomorphism Typessection
Higher Order Isomorphismsection
Planar and Dual Graphschapter
Graph Representationssection
Planar Graphssection
Kuratowski Graphssection
Planar Graph Representationssection
Planarity Testingsection
Geometric Dual Graphssection
Combinatorial Dualssection
Advanced Planarity Criteriasection
Graph Thickness and Crossingsection
Vector Spaces of a Graphchapter
Algebraic Structuressection
Advanced Algebraic Systemssection
Modular Arithmetic and Fieldssection
Vector Spacessection
Graph Vector Spacessection
Basis of Graphssection
Circuit and Cut-Set Spacessection
Orthogonality in Graphssection
Subspace Operationssection
Matrix Representation of Graphschapter
Incidence Matrixsection
Submatrices of Graph Matricessection
Circuit Matrixsection
Fundamental Circuit Matrixsection
Switching Network Applicationssection
Cut-Set Matrixsection
Matrix Relationshipssection
Path Matrixsection
Adjacency Matrixsection
Coloring Covering and Partitioningchapter
Chromatic Numbersection
Graph Coloring and Partitioningsection
Chromatic Polynomialsection
Matchingssection
Graph Coveringssection
Four Color Theoremsection
Directed Graphschapter
Directed Graphs Basicssection
Types of Directed Graphssection
Digraphs and Relationssection
Directed Paths and Connectivitysection
Euler Digraphssection
Directed Treessection
Circuits in Digraphssection
Matrix Representation of Digraphssection
Adjacency Matrix of Digraphssection
Tournaments and Comparisonssection
Acyclic Digraphssection
Enumeration of Graphschapter
Types of Enumerationsection
Counting Labeled Treessection
Counting Unlabeled Treessection
Polya Counting Theoremsection
Graph Enumeration Using Polyasection
Graph Theoretic Algorithmschapter
Introduction to Algorithmssection
Graph Representation in Computerssection
Algorithm Output Analysissection
Basic Graph Algorithmssection
Shortest Path Algorithmssection
Depth First Searchsection
Graph Isomorphism Algorithmsection
Advanced Graph Algorithmssection
Algorithm Complexitysection
Graph Programming Languagessection
Graphs in Switching and Codingchapter
Contact Networkssection
Analysis of Networkssection
Network Synthesissection
Sequential Switching Networkssection
Hypercube Graphssection
Graphs in Coding Theorysection
Electrical Network Analysischapter
Electrical Networks Basicssection
Kirchhoff Lawssection
Loop and Node Analysissection
Nodal Analysissection
Loop Analysissection
General Network Modelssection
Graph Theory in Operations Researchchapter
Transport Networkssection
Max Flow Min Cut Theoremsection
Minimum Cost Flowsection
Multicommodity Flowsection
Advanced Flow Applicationssection
Advanced Flow Problemssection
Activity Networkssection
Activity Network Analysissection
Advanced Scheduling Conceptssection
Graphs in Game Theorysection
Survey of Applicationschapter
Signal Flow Graphssection
Graphs in Markov Processessection
Graphs in Programmingsection
Graphs in Chemistrysection
Miscellaneous Applicationssection
Mathematical Logicchapter
Basic Logical Connectives and Truth Tablessection
Statements and Primitive Statementssubsection
Negation and Compound Statementssubsection
Conjunction and Disjunctionsubsection
Implication and Biconditionalsubsection
Open Sentences and Truth Valuessubsection
Truth Tables for Basic Connectivessubsection
Symbolic Translation of Compound Statementssubsection
Conditional Statements and Programming Decisionssubsection
Parentheses in Compound Truth Tablessubsection
Tautologies, Contradictions, and Valid Argumentssubsection
Truth-Table Applicationssubsection
Logical Equivalence and the Laws of Logicsection
Equivalent Forms of Compound Statementssubsection
De Morgan's Lawssubsection
Distributive Laws for Logical Connectivessubsection
Laws of Logicsubsection
Duality in Logical Equivalencesubsection
Substitution Rules for Logical Equivalencesubsection
Negation and Duals of Conditional Statementssubsection
Converse, Inverse, and Contrapositivesubsection
Nested Conditionals and Program Logicsubsection
Simplification of Compound Statementssubsection
Switching Networks and Logical Equivalencesubsection
NAND and NOR Connectivessubsection
Logical Implication and Rules of Inferencesection
Valid Arguments and Logical Implicationsubsection
Direct Rules of Inferencesubsection
Invalid Conditional Reasoningsubsection
Conjunction and Disjunction Rulessubsection
Contradiction and Indirect Proofsubsection
Proofs Using Several Rules of Inferencesubsection
Invalid Arguments and Counterexamplessubsection
Predicates and Quantifierssection
Open Statements and Universe of Discoursesubsection
Existential and Universal Quantifierssubsection
Implicit Quantification and Universe Dependencesubsection
Quantifiers in Programming Statementssubsection
Truth Conditions for Quantified Statementssubsection
Logical Equivalence and Implication of Predicatessubsection
Converse, Inverse, and Contrapositive of Quantified Implicationssubsection
Logical Laws for Quantified Statementssubsection
Negation of Quantified Statementssubsection
Multiple and Nested Quantifierssubsection
Negation of Nested Quantified Statementssubsection
Unique Existencesubsection
Quantifiers Definitions And Proofs Of Theoremssection
Biconditional Definitions with Quantifierssubsection
Proof by Exhaustion and Theorem Terminologysubsection
Universal Specification in Quantified Argumentssubsection
Universal Generalization in Theorem Proofssubsection
Quantifier Laws and Existential Rulessubsection
Integer Parity Definitions and Direct Proofssubsection
Indirect Proof Methods for Theoremssubsection

Relationships

Discrete Mathematics --contains--> Introduction To Discrete Mathematics
Introduction To Discrete Mathematics --contains--> What is a Graph
Introduction To Discrete Mathematics --contains--> Applications of Graphs
Introduction To Discrete Mathematics --contains--> Finite and Infinite Graphs
Introduction To Discrete Mathematics --contains--> Incidence and Degree
Introduction To Discrete Mathematics --contains--> Types of Vertices and Special Graphs
Introduction To Discrete Mathematics --contains--> History of Graph Theory
Discrete Mathematics --contains--> Paths and Circuits
Paths and Circuits --contains--> Graph Isomorphism
Paths and Circuits --contains--> Subgraphs
Paths and Circuits --contains--> Graph-Based Puzzles
Paths and Circuits --contains--> Walks Paths and Circuits
Paths and Circuits --contains--> Connected and Disconnected Graphs
Paths and Circuits --contains--> Euler Graphs
Paths and Circuits --contains--> Graph Operations
Paths and Circuits --contains--> Advanced Euler Graphs
Paths and Circuits --contains--> Hamiltonian Paths and Circuits
Paths and Circuits --contains--> Traveling Salesman Problem
Discrete Mathematics --contains--> Trees and Fundamental Circuits
Trees and Fundamental Circuits --contains--> Trees
Trees and Fundamental Circuits --contains--> Properties of Trees
Trees and Fundamental Circuits --contains--> Pendant Vertices in Trees
Trees and Fundamental Circuits --contains--> Distance and Centers in Trees
Trees and Fundamental Circuits --contains--> Rooted and Binary Trees
Trees and Fundamental Circuits --contains--> Counting Trees
Trees and Fundamental Circuits --contains--> Spanning Trees
Trees and Fundamental Circuits --contains--> Fundamental Circuits
Trees and Fundamental Circuits --contains--> Enumeration of Spanning Trees
Trees and Fundamental Circuits --contains--> Minimum Spanning Trees
Discrete Mathematics --contains--> Cut-Sets and Cut-Vertices
Cut-Sets and Cut-Vertices --contains--> Cut-Sets
Cut-Sets and Cut-Vertices --contains--> Properties of Cut-Sets
Cut-Sets and Cut-Vertices --contains--> Enumeration of Cut-Sets
Cut-Sets and Cut-Vertices --contains--> Circuits and Cut-Set Relations
Cut-Sets and Cut-Vertices --contains--> Connectivity and Separability
Cut-Sets and Cut-Vertices --contains--> Network Flow Basics
Cut-Sets and Cut-Vertices --contains--> Graph Isomorphism Types
Cut-Sets and Cut-Vertices --contains--> Higher Order Isomorphism
Discrete Mathematics --contains--> Planar and Dual Graphs
Planar and Dual Graphs --contains--> Graph Representations
Planar and Dual Graphs --contains--> Planar Graphs
Planar and Dual Graphs --contains--> Kuratowski Graphs
Planar and Dual Graphs --contains--> Planar Graph Representations
Planar and Dual Graphs --contains--> Planarity Testing
Planar and Dual Graphs --contains--> Geometric Dual Graphs
Planar and Dual Graphs --contains--> Combinatorial Duals
Planar and Dual Graphs --contains--> Advanced Planarity Criteria
Planar and Dual Graphs --contains--> Graph Thickness and Crossing
Discrete Mathematics --contains--> Vector Spaces of a Graph
Vector Spaces of a Graph --contains--> Algebraic Structures
Vector Spaces of a Graph --contains--> Advanced Algebraic Systems
Vector Spaces of a Graph --contains--> Modular Arithmetic and Fields
Vector Spaces of a Graph --contains--> Vector Spaces
Vector Spaces of a Graph --contains--> Graph Vector Spaces
Vector Spaces of a Graph --contains--> Basis of Graphs
Vector Spaces of a Graph --contains--> Circuit and Cut-Set Spaces
Vector Spaces of a Graph --contains--> Orthogonality in Graphs
Vector Spaces of a Graph --contains--> Subspace Operations
Discrete Mathematics --contains--> Matrix Representation of Graphs
Matrix Representation of Graphs --contains--> Incidence Matrix
Matrix Representation of Graphs --contains--> Submatrices of Graph Matrices
Matrix Representation of Graphs --contains--> Circuit Matrix
Matrix Representation of Graphs --contains--> Fundamental Circuit Matrix
Matrix Representation of Graphs --contains--> Switching Network Applications
Matrix Representation of Graphs --contains--> Cut-Set Matrix
Matrix Representation of Graphs --contains--> Matrix Relationships
Matrix Representation of Graphs --contains--> Path Matrix
Matrix Representation of Graphs --contains--> Adjacency Matrix
Discrete Mathematics --contains--> Coloring Covering and Partitioning
Coloring Covering and Partitioning --contains--> Chromatic Number
Coloring Covering and Partitioning --contains--> Graph Coloring and Partitioning
Coloring Covering and Partitioning --contains--> Chromatic Polynomial
Coloring Covering and Partitioning --contains--> Matchings
Coloring Covering and Partitioning --contains--> Graph Coverings
Coloring Covering and Partitioning --contains--> Four Color Theorem
Discrete Mathematics --contains--> Directed Graphs
Directed Graphs --contains--> Directed Graphs Basics
Directed Graphs --contains--> Types of Directed Graphs
Directed Graphs --contains--> Digraphs and Relations
Directed Graphs --contains--> Directed Paths and Connectivity
Directed Graphs --contains--> Euler Digraphs
Directed Graphs --contains--> Directed Trees
Directed Graphs --contains--> Circuits in Digraphs
Directed Graphs --contains--> Matrix Representation of Digraphs
Directed Graphs --contains--> Adjacency Matrix of Digraphs
Directed Graphs --contains--> Tournaments and Comparisons
Directed Graphs --contains--> Acyclic Digraphs
Discrete Mathematics --contains--> Enumeration of Graphs
Enumeration of Graphs --contains--> Types of Enumeration
Enumeration of Graphs --contains--> Counting Labeled Trees
Enumeration of Graphs --contains--> Counting Unlabeled Trees
Enumeration of Graphs --contains--> Polya Counting Theorem
Enumeration of Graphs --contains--> Graph Enumeration Using Polya
Discrete Mathematics --contains--> Graph Theoretic Algorithms
Graph Theoretic Algorithms --contains--> Introduction to Algorithms
Graph Theoretic Algorithms --contains--> Graph Representation in Computers
Graph Theoretic Algorithms --contains--> Algorithm Output Analysis
Graph Theoretic Algorithms --contains--> Basic Graph Algorithms
Graph Theoretic Algorithms --contains--> Shortest Path Algorithms
Graph Theoretic Algorithms --contains--> Depth First Search
Graph Theoretic Algorithms --contains--> Graph Isomorphism Algorithm
Graph Theoretic Algorithms --contains--> Advanced Graph Algorithms
Graph Theoretic Algorithms --contains--> Algorithm Complexity
Graph Theoretic Algorithms --contains--> Graph Programming Languages
Discrete Mathematics --contains--> Graphs in Switching and Coding
Graphs in Switching and Coding --contains--> Contact Networks
Graphs in Switching and Coding --contains--> Analysis of Networks
Graphs in Switching and Coding --contains--> Network Synthesis
Graphs in Switching and Coding --contains--> Sequential Switching Networks
Graphs in Switching and Coding --contains--> Hypercube Graphs
Graphs in Switching and Coding --contains--> Graphs in Coding Theory
Discrete Mathematics --contains--> Electrical Network Analysis
Electrical Network Analysis --contains--> Electrical Networks Basics
Electrical Network Analysis --contains--> Kirchhoff Laws
Electrical Network Analysis --contains--> Loop and Node Analysis
Electrical Network Analysis --contains--> Nodal Analysis
Electrical Network Analysis --contains--> Loop Analysis
Electrical Network Analysis --contains--> General Network Models
Discrete Mathematics --contains--> Graph Theory in Operations Research
Graph Theory in Operations Research --contains--> Transport Networks
Graph Theory in Operations Research --contains--> Max Flow Min Cut Theorem
Graph Theory in Operations Research --contains--> Minimum Cost Flow
Graph Theory in Operations Research --contains--> Multicommodity Flow
Graph Theory in Operations Research --contains--> Advanced Flow Applications
Graph Theory in Operations Research --contains--> Advanced Flow Problems
Graph Theory in Operations Research --contains--> Activity Networks
Graph Theory in Operations Research --contains--> Activity Network Analysis
Graph Theory in Operations Research --contains--> Advanced Scheduling Concepts
Graph Theory in Operations Research --contains--> Graphs in Game Theory
Discrete Mathematics --contains--> Survey of Applications
Survey of Applications --contains--> Signal Flow Graphs
Survey of Applications --contains--> Graphs in Markov Processes
Survey of Applications --contains--> Graphs in Programming
Survey of Applications --contains--> Graphs in Chemistry
Survey of Applications --contains--> Miscellaneous Applications
Discrete Mathematics --contains--> Mathematical Logic
Mathematical Logic --contains--> Basic Logical Connectives and Truth Tables
Basic Logical Connectives and Truth Tables --contains--> Statements and Primitive Statements
Basic Logical Connectives and Truth Tables --contains--> Negation and Compound Statements
Basic Logical Connectives and Truth Tables --contains--> Conjunction and Disjunction
Basic Logical Connectives and Truth Tables --contains--> Implication and Biconditional
Basic Logical Connectives and Truth Tables --contains--> Open Sentences and Truth Values
Basic Logical Connectives and Truth Tables --contains--> Truth Tables for Basic Connectives
Basic Logical Connectives and Truth Tables --contains--> Symbolic Translation of Compound Statements
Basic Logical Connectives and Truth Tables --contains--> Conditional Statements and Programming Decisions
Basic Logical Connectives and Truth Tables --contains--> Parentheses in Compound Truth Tables
Basic Logical Connectives and Truth Tables --contains--> Tautologies, Contradictions, and Valid Arguments
Basic Logical Connectives and Truth Tables --contains--> Truth-Table Applications
Mathematical Logic --contains--> Logical Equivalence and the Laws of Logic
Logical Equivalence and the Laws of Logic --contains--> Equivalent Forms of Compound Statements
Logical Equivalence and the Laws of Logic --contains--> De Morgan's Laws
Logical Equivalence and the Laws of Logic --contains--> Distributive Laws for Logical Connectives
Logical Equivalence and the Laws of Logic --contains--> Laws of Logic
Logical Equivalence and the Laws of Logic --contains--> Duality in Logical Equivalence
Logical Equivalence and the Laws of Logic --contains--> Substitution Rules for Logical Equivalence
Logical Equivalence and the Laws of Logic --contains--> Negation and Duals of Conditional Statements
Logical Equivalence and the Laws of Logic --contains--> Converse, Inverse, and Contrapositive
Logical Equivalence and the Laws of Logic --contains--> Nested Conditionals and Program Logic
Logical Equivalence and the Laws of Logic --contains--> Simplification of Compound Statements
Logical Equivalence and the Laws of Logic --contains--> Switching Networks and Logical Equivalence
Logical Equivalence and the Laws of Logic --contains--> NAND and NOR Connectives
Mathematical Logic --contains--> Logical Implication and Rules of Inference
Logical Implication and Rules of Inference --contains--> Valid Arguments and Logical Implication
Logical Implication and Rules of Inference --contains--> Direct Rules of Inference
Logical Implication and Rules of Inference --contains--> Invalid Conditional Reasoning
Logical Implication and Rules of Inference --contains--> Conjunction and Disjunction Rules
Logical Implication and Rules of Inference --contains--> Contradiction and Indirect Proof
Logical Implication and Rules of Inference --contains--> Proofs Using Several Rules of Inference
Logical Implication and Rules of Inference --contains--> Invalid Arguments and Counterexamples
Mathematical Logic --contains--> Predicates and Quantifiers
Predicates and Quantifiers --contains--> Open Statements and Universe of Discourse
Predicates and Quantifiers --contains--> Existential and Universal Quantifiers
Predicates and Quantifiers --contains--> Implicit Quantification and Universe Dependence
Predicates and Quantifiers --contains--> Quantifiers in Programming Statements
Predicates and Quantifiers --contains--> Truth Conditions for Quantified Statements
Predicates and Quantifiers --contains--> Logical Equivalence and Implication of Predicates
Predicates and Quantifiers --contains--> Converse, Inverse, and Contrapositive of Quantified Implications
Predicates and Quantifiers --contains--> Logical Laws for Quantified Statements
Predicates and Quantifiers --contains--> Negation of Quantified Statements
Predicates and Quantifiers --contains--> Multiple and Nested Quantifiers
Predicates and Quantifiers --contains--> Negation of Nested Quantified Statements
Predicates and Quantifiers --contains--> Unique Existence
Mathematical Logic --contains--> Quantifiers Definitions And Proofs Of Theorems
Quantifiers Definitions And Proofs Of Theorems --contains--> Biconditional Definitions with Quantifiers
Quantifiers Definitions And Proofs Of Theorems --contains--> Proof by Exhaustion and Theorem Terminology
Quantifiers Definitions And Proofs Of Theorems --contains--> Universal Specification in Quantified Arguments
Quantifiers Definitions And Proofs Of Theorems --contains--> Universal Generalization in Theorem Proofs
Quantifiers Definitions And Proofs Of Theorems --contains--> Quantifier Laws and Existential Rules
Quantifiers Definitions And Proofs Of Theorems --contains--> Integer Parity Definitions and Direct Proofs
Quantifiers Definitions And Proofs Of Theorems --contains--> Indirect Proof Methods for Theorems

Discrete Mathematics

Learning structure

Discrete Mathematics Learning Map

Concepts

Relationships

Chapters

Introduction To Discrete Mathematics

Paths and Circuits

Trees and Fundamental Circuits

Cut-Sets and Cut-Vertices

Planar and Dual Graphs

Vector Spaces of a Graph

Matrix Representation of Graphs

Coloring Covering and Partitioning

Directed Graphs

Enumeration of Graphs

Graph Theoretic Algorithms

Graphs in Switching and Coding

Electrical Network Analysis

Graph Theory in Operations Research

Survey of Applications

Mathematical Logic

Curated pathways

Metric Spaces

Introduction To Discrete Mathematics