Abstract
The coritivity, h(G), of a connected graph G, is defined by h(G)=max{ω(G-S)-|S|}, 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 norion 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.
| Original language | English |
|---|---|
| Pages (from-to) | 28-34 |
| Number of pages | 7 |
| Journal | Journal of Systems Engineering and Electronics |
| Volume | 4 |
| Issue number | 2 |
| Publication status | Published - 1993 |
| Externally published | Yes |