Let $G=(V,E)$, $V=\left\{ v_{1},v_{2},\ldots ,v_{n}\right\}$, be a simple graph of order $n$ and size $m$.Denote by $\Delta = d_1\ge d_2 \ge \cdots \ge d_n= \delta$, $d_i=d(v_i)$, and $\Delta_e=d(e_1)\ge d(e_2)\ge \cdots ...

In this paper, lower bound and upper bound on the covering radius ofDNA codes over a finite ring N with respect to Chinese euclidean distanceare given. Also determine the covering radius of various Repetition DNAcodes, ...

The symmetric division degree (SDD) index is one the 148 discrete Adriatic indices,introduced by Vukicevi´c et al. as a remarkable predictor of total surface area of polychlorobiphenyls.The SDD index has already been proved ...

A graph is called one-regular if its full automorphism group acts regularly on the set of arcs. In this paper, we classify all connected one-regular graphs of valency 4 of order $p^2q^2$, where $p>q$ are prime numbers. We ...

This paper presents a comprehensive analysis of the role of topological indices andcentrality measures in predicting the chemical properties of molecules, with a specific focus on sixdrugs known for their effectiveness in ...