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.

结实偏心指数是基于度距离的图不变性，而修改后的第二Zagreb指数是基于度的图不变性。Parikh单词可表示图是图G（w）的新一类，它对应于符号w的有限序列的单词w。在本文中，我们对于该连接偏心指数第一本明确的公式和修改Parikh的字的第二萨格勒布索引对应于所述形式的二进制核心词表示的曲线图奥夫在二进制字母表\（\ {A，\，B \} \ ）， 分别。然后，我们研究了连接偏心率指数与修改后的第二Zagreb指数之间的关系，并获得了关于这两个指数的一些比较结果。