The coritivity, h(G), of a connected graph G, is defined by h(G) = max{ω(G-S)-|S|: S∈C(G)}, where ω(G) denotes the number of components of a graph G, C(G) denotes the collection of cut-sets of G. In this paper, the...The coritivity, h(G), of a connected graph G, is defined by h(G) = max{ω(G-S)-|S|: S∈C(G)}, where ω(G) denotes the number of components of a graph G, C(G) denotes the collection of cut-sets of G. In this paper, the notion of complementary coritivity is proposed, and the relations between coritivity and its complement are studied, for example, two bounds, Nordaus-Gaddum problems and some foundational properties etc.展开更多
基金Research supported by the National Natural Science Foundation of China
文摘The coritivity, h(G), of a connected graph G, is defined by h(G) = max{ω(G-S)-|S|: S∈C(G)}, where ω(G) denotes the number of components of a graph G, C(G) denotes the collection of cut-sets of G. In this paper, the notion of complementary coritivity is proposed, and the relations between coritivity and its complement are studied, for example, two bounds, Nordaus-Gaddum problems and some foundational properties etc.
