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...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
1993
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/114824/1/114824.pdf http://psasir.upm.edu.my/id/eprint/114824/ https://linkinghub.elsevier.com/retrieve/pii/0012365X9390147L |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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 toughness τc(G) of a graph G, we prove that 'τc(G)≥k if and only if G has k edge-disjoint spanning forests with exactly c components'. We also study the 'balancity' of a graph G of order p and size q, which is defined as the smallest positive integer c such that τc(G) = p/(p-c). © 1993. |
|---|