Sufficient conditions for triangle-free graphs to be super-$λ'$
An edge-cut $F$ of a connected graph $G$ is called a restricted edge-cut if $G-F$ contains no isolated vertices. The minimum cardinality of all restricted edge-cuts is called the restricted edge-connectivity $λ'(G)$ of $G$. A graph $G$ is said to be $λ'$-optimal if $λ'(G)=xi(G...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Isfahan
2018-09-01
|
| Series: | Transactions on Combinatorics |
| Subjects: | |
| Online Access: | http://toc.ui.ac.ir/article_22415_297dcf89662c9125339a728e85ad39e3.pdf |