ABSTRACT: Researching Supereulerian index of a graph G is NP-hard. In this paper, we consider Supereulerian indices of some classes of graphs, Supereulerian index means the minimum integer k of ...