Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal

@article{Zhang2007DegreeCF,
  title={Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal},
  author={Zhao Zhang and Jinjiang Yuan},
  journal={Discrete Mathematics},
  year={2007},
  volume={307},
  pages={293-298}
}
For a connected graph G= (V , E), an edge set S ⊂ E is a k-restricted-edge-cut, if G−S is disconnected and every component of G − S has at least k vertices. The k-restricted-edge-connectivity of G, denoted by k(G), is defined as the cardinality of a minimum k-restricted-edge-cut. The k-isoperimetric-edge-connectivity is defined as k(G) = min{|[U, U ]| : U ⊂ V, |U | k, |U | k}, where [U, U ] is the set of edges with one end in U and the other end in U =V \U . In this note, we give some degree… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 14 references

Optimally super-edge-connected transitive graphs

Discrete Mathematics • 2003
View 2 Excerpts

On a kind of restricted edge connectivity of graphs

Discrete Applied Mathematics • 2002
View 1 Excerpt

An Ore type sufficient condition for a graph to be super restricted edge-connected

Y. Q. Wang, Q. Li
J. Shanghai Jiaotong University 35 • 2001
View 2 Excerpts

Similar Papers

Loading similar papers…