Strength and fractional arboricity of complementary graphs
详细信息 查看全文
文摘
Let G be a simple graph and Gc be the complement of G. Let ω(G) denote the number of components of G. As in Catlin et al. (1992), for a nontrivial graph G, the strength of G is Formula Not Shown where the minimum is over all subsets S 
E(G) such that ω(G − S) > ω(G). Thefractional arboricity of a nontrivial graph G is Formula Not Shown where the maximum runs over all subgraphs H with 
V(H) > ω(H).
E(G) such that ω(G − S) > ω(G). Thefractional arboricity of a nontrivial graph G is Formula Not Shown where the maximum runs over all subgraphs H with V(H) > ω(H).