Back to Search
Start Over
-restricted edge-connectivity in triangle-free graphs
- Source :
-
Discrete Applied Mathematics . Jun2012, Vol. 160 Issue 9, p1345-1355. 11p. - Publication Year :
- 2012
-
Abstract
- Abstract: Let be a -connected graph. is called -optimal, if its -restricted edge-connectivity equals its minimum -edge degree.  is called super- if every -cut isolates a connected subgraph of order . Firstly, we give a lower bound on the order of -fragments in triangle-free graphs that are not -optimal. Secondly, we present an Ore-type condition for triangle-free graphs to be -optimal. Thirdly, we prove a lower bound on the order of -fragments in triangle-free -connected graphs, and use it to show that triangle-free graphs with high minimum degree are -optimal and super-. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 0166218X
- Volume :
- 160
- Issue :
- 9
- Database :
- Academic Search Index
- Journal :
- Discrete Applied Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 73765721
- Full Text :
- https://doi.org/10.1016/j.dam.2012.01.022