The connective eccentricity index and modified second Zagreb index of Parikh word representable graphs

The connective eccentricity index is a degree-distance-based graph invariant, while the modified second Zagreb index is a degree-based graph invariant. The Parikh word representable graph is a new class of graphs G(w), which corresponds to words w that are finite sequence of symbols. In this paper, we first present explicit formulas for the connective eccentricity index and modified second Zagreb index of the Parikh word representable graphs corresponding to binary core words of the form aub over a binary alphabet $$\{a,\,b\}$$ , respectively. Then, we investigate the relationship between the connective eccentricity index and modified second Zagreb index and obtain some comparative results about these two indices.