Edge-maximal C2k+1-vertex disjoint free graphs

Abstract EN

Let k ≥ 1 be a positive integer and g (n ; V 2K +1) the class of graphs on n vertices containing no 2k+1 vertex disjoint cycles.

Let f (n ; V 2K + 1) max {∈ (G) : G ∈ g n ; V 2K + 1} .

In this paper we determine (n ; V 2K + 1)and characterise the edge maximal members in g (n ; V 2K + 1) for k = 1 and 2.