Note on the connectivity of line graphs |
| |
| Authors: | Angelika Hellwig Dieter Rautenbach |
| |
| Affiliation: | a Lehrstuhl II für Mathematik, RWTH Aachen University, 52056 Aachen, Germany
b Forschungsinstitut für Diskrete Mathematik, University Bonn, 53113 Bonn, Germany |
| |
| Abstract: | Let G be a connected graph with vertex set V(G), edge set E(G), vertex-connectivity κ(G) and edge-connectivity λ(G).A subset S of E(G) is called a restricted edge-cut if G−S is disconnected and each component contains at least two vertices. The restricted edge-connectivity λ2(G) is the minimum cardinality over all restricted edge-cuts. Clearly λ2(G)?λ(G)?κ(G).In 1969, Chartrand and Stewart have shown that |
| |
| Keywords: | Fault tolerance Line graphs Connectivity Restricted edge-connectivity |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
