Let G be a connected graph with the vertex set V = {v 1 , v 2 , . . ., v n }, where n ≥ 2. Denote by d i the degree of the vertex v i for i = 1, 2, . . . , n. If v i and v j are adjacent in G, we write i ∼ j, otherwise we write i j. The variable sum exdeg index and coindex of G are defined as, respectively, where 'a' is a positive real number different from 1. Some inequalities involving SEI a (G) or/and SEI a (G) are derived. Special cases of the obtained inequalities are also discussed for unicyclic graphs.