On independent doubly chorded cycles

In a graph G, we say a cycle C:v1,v2,…,vk,v1 is chorded if its vertices induce an additional edge (chord) which is not an edge of the cycle. The cycle C is doubly chorded if there are at least two such chords. In this paper we show a sharp degree sum condition that implies the existence of k vertex disjoint doubly chorded cycles in a graph.