Everything about Graph theory
Area of discrete mathematics
In mathematics and computer science, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of vertices which are connected by edges. A distinction is made between undirected graphs, where edges link two vertices symmetrically, and directed graphs, where edges link two vertices asymmetrically. Graphs are one of the principal objects of study in discrete mathematics. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Graph theoryA 5-minute orientation
- Skim a recent paper: Modern chemical graph theoryInfluential work since 2022
- Pick up a classic book: Introduction to graph theoryThe most-reprinted book on the subject
- Read the landmark paper: Graph TheoryCited 112 times
- Go sideways: Complete bipartite graphA closely related topic
- Go sideways: Spanning treeA closely related topic
📖 Definitions
Noun The branch of mathematics dealing with the properties of graphs (networks of vertices and edges).
Noun A theory developed by applying graph theory to a particular problem or application.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Graph Theory
Graph minor theory
Graph Theory
Perturbation-graph theory—I
Graph Theory
Graph Theory
Graph Theory.
Graph theory approach
🆕 Influential since 2022
📚 Books worth reading
Introduction to graph theoryRobin J. Wilson · 1972
Graphs & digraphsGary Chartrand, L. Lesniak · 1986
Graph theory and its applicationsJonathan L. Gross, Jay Yellen · 1999
Applied combinatoricsAlan C. Tucker · 1980
Pearls in graph theoryNora Hartsfield · 1990- 📕Théorie des graphes et ses applicationsClaude Berge · 1958
Graph theoryFrank Harary · 1969
Chromatic graph theoryGary Chartrand, Zhang, Ping · 2008
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Complete bipartite graph In the mathematical field of graph theory, a complete bipartite graph or biclique is a special kind of bipartite graph where every vertex of the first…
- Spanning tree In the mathematical field of graph theory, a spanning tree T of an undirected graph G is a subgraph that is a tree which includes all of the vertices of…
- Glossary of graph theory Look up Appendix:Glossary of graph theory in Wiktionary, the free dictionary. This is a glossary of graph theory. Graph theory is the study of graphs,…
- Edge coloring In graph theory, a proper edge coloring of a graph is an assignment of "colors" to the edges of the graph so that no two incident edges have the same color…
- Bipartite graph In the mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets…
- Dual graph In the mathematical discipline of graph theory, the dual graph of a planar graph G is a graph that has a vertex for each face of G. The dual graph has…
- Cyclomatic number In graph theory, a branch of mathematics, the cyclomatic number, circuit rank, cycle rank, corank or nullity of an undirected graph is the minimum number…
- Clique (graph theory) In graph theory, a clique (/ˈkliːk/ or /ˈklɪk/) is a subset of vertices of an undirected graph such that every two distinct vertices in the clique are…