Graph Theory¶
Bondy, J. A., & Murty, U. S. R. (2008). Graph Theory. Springer.
Cited by¶
4 citations across 4 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Cut
- Cut-based formulation of clustering and segmentation: finding a partition with small inter-part interaction is one problem under many disguises — community detection, image segmentation, module finding. Resilience as cut hardness: a network tolerates \(k\) failures exactly when its minimum cut exceeds \(k\), which turns a vague resilience goal into a clean quantitative target.
This sourceGraduate Texts in Mathematics 244. New York: Springer, 2008. Standard reference for connectivity: a graph is k-edge-connected iff its minimum edge cut is at least k, so a network tolerates k−1 edge failures (resilience as cut hardness).
- Cut-based formulation of clustering and segmentation: finding a partition with small inter-part interaction is one problem under many disguises — community detection, image segmentation, module finding. Resilience as cut hardness: a network tolerates \(k\) failures exactly when its minimum cut exceeds \(k\), which turns a vague resilience goal into a clean quantitative target.
- Cycle
- Graph theory and combinatorics. Cycles are foundational objects (Hamiltonian cycles, Eulerian circuits, the cycle space of a graph, girth), and properties such as robustness and planarity are decided by cycle structure.
This sourceGraduate Texts in Mathematics 244. New York: Springer, 2008. Standard reference for cycles as foundational graph objects: Hamiltonian cycles, Eulerian circuits, cycle space, girth, and their role in robustness and planarity.
- Graph theory and combinatorics. Cycles are foundational objects (Hamiltonian cycles, Eulerian circuits, the cycle space of a graph, girth), and properties such as robustness and planarity are decided by cycle structure.
- Single Point of Failure
- A network of N components has up to a quadratic number of possible dependencies, and tracing all of them is intractable.
This sourceStandard graph-theory text establishing that the complete graph on N vertices has N(N−1)/2 edges, so the number of possible pairwise dependencies is quadratic in N.
- A network of N components has up to a quadratic number of possible dependencies, and tracing all of them is intractable.
Domain-specific¶
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Links previously used in the corpus¶
Before the registry existed this work was also linked 1 other way.
Registry ID ref:630c8f079bed · see in the full table