Live briefing
Everything about Complete graph
Graph in which every two vertices are adjacent
In the mathematical field of graph theory, a complete graph is a simple undirected graph in which every pair of distinct vertices is connected by a unique edge. A complete digraph is a directed graph in which every pair of distinct vertices is connected by a pair of unique edges. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Complete graphA 5-minute orientation
- Skim a recent paper: Jet discrimination with a quantum complete graph neural networkInfluential work since 2022
- Pick up a classic book: The primal factorization of complete graphsThe most-reprinted book on the subject
- Read the landmark paper: Complex brain networks: graph theoretical analysis of structural and functional systemsCited 10,598 times
- Go sideways: Polyhedral graphA closely related topic
- Go sideways: Planar graphA closely related topic
📖 Definitions
Noun A graph where every pair of vertices is connected by an edge.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Complex brain networks: graph theoretical analysis of structural and functional systems
MEGAHIT: an ultra-fast single-node solution for large and complex metagenomics assembly via succinct de Bruijn graph
Reversed graph embedding resolves complex single-cell trajectories
Learning Entity and Relation Embeddings for Knowledge Graph Completion
🆕 Influential since 2022
📚 Books worth reading
- 📕The primal factorization of complete graphsLarry Kerschberg · 1972
- 📕Linear-time algorithms for NP-complete problems restricted to partial k-treesPetra Scheffler · 1987
An NP-complete matching problemDavid A. Plaisted · 1979- 📕Commutative algebra and its connections to geometryPan-American Advanced Studies Institute (2009 Universidade Federal de Pernambuco) · 2011
Algebraic And Geometric Aspects Of Integrable Systems And Random Matrices Ams Special Session Algebraic And Geometric Aspects Of Integrable Systems And Random Matrices January 67 2012 Boston MaAlgebraic and · 2013
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Polyhedral graph In geometric graph theory, a branch of mathematics, a polyhedral graph is the undirected graph formed from the vertices and edges of a convex polyhedron…
- Planar graph In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect…
- 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…
- Crossing number (graph theory) In graph theory, the crossing number cr(G) of a graph G is the lowest number of edge crossings of a plane drawing of the graph G. For instance, a graph…
- Barnette's conjecture Unsolved problem in mathematics Is every cubic bipartite polyhedral graph Hamiltonian? More unsolved problems in mathematics Barnette's conjecture is an…
- Geometric graph theory Geometric graph theory in the broader sense is a large and amorphous subfield of graph theory, concerned with graphs defined by geometric means. In a stricter…
- 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…
- 1-planar graph In topological graph theory, a 1-planar graph is a graph that can be drawn in the Euclidean plane in such a way that each edge has at most one crossing…