edge-contraction
Given an edge of a graph , the graph is obtained from by contracting the edge ; that is, to get we identify the vertices and and remove all loops and duplicate edges. A graph obtained by a sequence of edge-contractions is said to be a contraction of .
Adapted with permission of the author from by Béla Bollobás, published by Springer-Verlag New York, Inc., 1998.
| Title | edge-contraction |
|---|---|
| Canonical name | Edgecontraction |
| Date of creation | 2013-03-22 12:31:43 |
| Last modified on | 2013-03-22 12:31:43 |
| Owner | rspuzio (6075) |
| Last modified by | rspuzio (6075) |
| Numerical id | 5 |
| Author | rspuzio (6075) |
| Entry type | Definition |
| Classification | msc 05C99 |
| Related topic | TheoremOn3ConnectedGraphs |
| Defines | contraction |