Live briefing
Everything about Edge connectivity
Graph which remains connected when fewer than k edges are removed
In graph theory, a connected graph is k-edge-connected if it remains connected whenever fewer than k edges are removed. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Edge connectivityA 5-minute orientation
- Skim a recent paper: A Taxonomy and Survey of Edge Cloud Computing for Intelligent Transportation Systems and Connected VehiclesInfluential work since 2022
- Pick up a classic book: Weird MathsThe most-reprinted book on the subject
- Read the landmark paper: Edge-connectivity augmentation problemsCited 172 times
- Go sideways: Connectivity (graph theory)A closely related topic
- Go sideways: Menger's theoremA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Edge-connectivity augmentation problems
Optimizing algebraic connectivity by edge rewiring
On extra connectivity and extra edge-connectivity of balanced hypercubes
Super-connectivity and super-edge-connectivity for some interconnection networks
Fault-tolerant strong Menger (edge) connectivity and 3-extra edge-connectivity of balanced hypercubes
Reducing edge connectivity to vertex connectivity
Relationship between extra edge connectivity and component edge connectivity for regular graphs
On cyclic edge-connectivity of fullerenes
🆕 Influential since 2022
A Taxonomy and Survey of Edge Cloud Computing for Intelligent Transportation Systems and Connected Vehicles
Component edge connectivity of folded hypercube-like networks
Component edge connectivity of hypercube-like networks
Embedded edge connectivity of k-ary n-cubes
Super Vertex (Edge)-Connectivity of Varietal Hypercube
📚 Books worth reading
Weird MathsDavid J. Darling, Agnijo Banerjee · 2018
Art of CommunicationJim Stovall, Ray H. Hull · 2016- 📕Mobile Edge ComputingDirk Lindemeier, Mansoor Hanif · 2017
Walk from the Wild EdgeJake Tyler · 2021
Knowledge ManagementAmerican Productivity & Quality Center · 1996- 📕A thousand and one fore-edge paintingsWeber, Carl Jefferson · 1949
The Food ConnectionSam Graci · 2009
The Mental EdgeKenneth Baum · 1999
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Connectivity (graph theory) In mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges)…
- Menger's theorem In the mathematical discipline of graph theory, Menger's theorem says that in a finite graph, the size of a minimum cut set is equal to the maximum number…
- Vertex connectivity In graph theory, a connected graph G is said to be k-vertex-connected (or k-connected) if it has more than k vertices and remains connected whenever fewer…
- 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,…
- 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…
- Gammoid In matroid theory, a field within mathematics, a gammoid is a certain kind of matroid, describing sets of vertices that can be reached by vertex-disjoint…
- Component (graph theory) In graph theory, a component of an undirected graph is a connected subgraph that is not part of any larger connected subgraph. The components of any graph…
- Pseudoforest In graph theory, a pseudoforest is an undirected graph in which every connected component has at most one cycle. That is, it is a system of vertices and…