Live briefing
Everything about Simplex graph
Graph representing connectivity between cliques of another graph
In graph theory, a branch of mathematics, the simplex graph κ(G) of an undirected graph G is itself a graph, with one node for each clique (a set of mutually adjacent vertices) in G. Two nodes of κ(G) are linked by an edge whenever the corresponding two cliques differ in the presence or absence of a single vertex. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Simplex graphA 5-minute orientation
- Skim a recent paper: Scalable codes with locality and availability derived from tessellation via [7, 3, 4] Simplex code graphInfluential work since 2022
- Pick up a classic book: Linear Algebra with ApplicationsThe most-reprinted book on the subject
- Read the landmark paper: DRL-GAT-SA: Deep reinforcement learning for autonomous driving planning based on graph attention networks and simplex architectureCited 44 times
- Go sideways: Median graphA closely related topic
- Go sideways: Fibonacci cubeA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
No outline available.
🏆 Landmark papers (most cited)
DRL-GAT-SA: Deep reinforcement learning for autonomous driving planning based on graph attention networks and simplex architecture
Graph-theory-based simplex algorithm for VLSI layout spacing problems with multiple variable constraints
The graph of 4-ary simplex codes of dimension 2
On maximal cliques in the graph of simplex codes
A Pursuit–Evasion Differential Game with Slow Pursuers on the Edge Graph of a Simplex. I
Graph Matching via convex relaxation to the simplex
Differential Game with Slow Pursuers on the Edge Graph of a Simplex
Construction of Full Order-of-Addition Generalization Simplex-Centroid Designs by the Directed Graph Approach
🆕 Influential since 2022
📚 Books worth reading
Linear Algebra with ApplicationsGareth Williams · 1984
Graphs, Networks and AlgorithmsDieter Jungnickel · 2006
Mathematical programming at Oberwolfach IIB. H. Korte, M. L. Balinski · 1984
Algorithm Design and ApplicationsMichael T. Goodrich, Roberto Tamassia · 2014
Coding the MatrixPhilip N. Klein · 2013- 📕Degeneracy Graphs and Simplex CyclingPeter Zörnig · 2012
- 📕Degeneracy graphs and simplex cyclingPeter Zörnig · 1991
Computational geometry · 1997
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Median graph In graph theory, a division of mathematics, a median graph is an undirected graph in which every three vertices a, b, and c have a unique median: a vertex…
- Fibonacci cube In the mathematical field of graph theory, the Fibonacci cubes or Fibonacci networks are a family of undirected graphs with rich recursive properties derived…
- Partial cube In graph theory, a partial cube is a graph that is an isometric subgraph of a hypercube. In other words, a partial cube can be identified with a subgraph…
- Tensor product of graphs In graph theory, the tensor product G × H of graphs G and H is a graph such that the vertex set of G × H is the Cartesian product V(G) × V(H); and vertices…
- Clique complex Clique complexes, independence complexes, flag complexes, Whitney complexes and conformal hypergraphs are closely related mathematical objects in graph…
- Convex subgraph In metric graph theory, a convex subgraph of an undirected graph G is a subgraph that includes every shortest path in G between two of its vertices. Thus…
- Cartesian product of graphs In graph theory, the Cartesian product G □ H of graphs G and H is a graph such that: the vertex set of G □ H is the Cartesian product V(G) × V(H); and…
- Modular graph In graph theory, a branch of mathematics, the modular graphs are undirected graphs in which every three vertices x, y, and z have at least one median vertex…