On the higher-order edge toughness of a graph
For an integer c, 1≤c≤{curly logical or}V(G){curly logical or}-1, we define the cth-order edge toughness of a graph G as tc(G)=min |X| ω(G-X)-cX⊆E(G) & ω(G-X)>c The objective of this paper is to study this generalized concept of edge toughness. Besides giving the of the cth-order edge toughne...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
1993
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/114824/1/114824.pdf |