Thek-Restricted Edge Connectivity of Balanced Bipartite Graphs
β Scribed by Jun Yuan; Aixia Liu
- Book ID
- 106047902
- Publisher
- Springer Japan
- Year
- 2010
- Tongue
- English
- Weight
- 220 KB
- Volume
- 27
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
For a connected graph G = (V, E), an edge set S β E is a restricted edge cut if G -S is disconnected and there is no isolated vertex in G -S. The cardinality of a minimum restricted edge cut of G is the restricted edge connectivity of G, denoted by Ξ» (G). , where ΞΎ(G) is the minimum edge degree of
## Abstract Given a bipartite graph __G__(__U__βͺ__V, E__) with __n__ vertices on each side, an independent set __I__β__G__ such that |__U__β©__I__|=|__V__β©__I__| is called a balanced bipartite independent set. A balanced coloring of __G__ is a coloring of the vertices of __G__ such that each color c