On the 3-restricted edge connectivity of permutation graphs
An edge cut W of a connected graph G is a k-restricted edge cut if G−W is disconnected, and every component of G−W has at least k vertices. The k-restricted edge connectivity is defined as the minimum cardinality over all k-restricted edge cuts. A permutation graph is obtained by taking two disjoint...
| Author: | |
|---|---|
| Format: | article |
| Status: | Published version |
| Publication Date: | 2009 |
| Country: | México |
| Institution: | Universidad Autónoma Metropolitana |
| Repository: | Concentración de Recursos de Información Científica y Académica, UAM Cuajimalpa |
| Language: | English |
| OAI Identifier: | oai:ilitia.cua.uam.mx:123456789/519 |
| Online Access: | http://ilitia.cua.uam.mx:8080/jspui/handle/123456789/519 |
| Access Level: | Open access |
| Keyword: | info:eu-repo/classification/cti/7 Algoritmos computacionales Optimización matemática Gráfico de conectividad |
| Summary: | An edge cut W of a connected graph G is a k-restricted edge cut if G−W is disconnected, and every component of G−W has at least k vertices. The k-restricted edge connectivity is defined as the minimum cardinality over all k-restricted edge cuts. A permutation graph is obtained by taking two disjoint copies of a graph and adding a perfect matching between the two copies. The k-restricted edge connectivity of a permutation graph is upper bounded by the so-called minimum k-edge degree. In this paper some sufficient conditions guaranteeing optimal k-restricted edge connectivity and super k-restricted edge connectivity for permutation graphs are presented for k=2,3. |
|---|