<p>Graph–theoretic degree–based descriptors play a central role in chemoinformatics and QSPR/QSAR modelling, yet most classical indices either focus purely on vertex degrees or treat bond contributions in a purely multiplicative way. In this work we introduce and systematically study a new family of <i>modified bond-based indices</i> in which each edge <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(uv\in E(G)\)</EquationSource> </InlineEquation> is weighted by a local bond factor <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(\mathcal {T}(uv)={\phi _G(\textrm{u})}+{\phi _G(\textrm{v})}-2\)</EquationSource> </InlineEquation> in the <i>denominator</i>, coupled with a vertex kernel in the numerator. This construction yields modified versions of the first and second Zagreb indices, the Forgotten and Yemen indices, several connectivity-type descriptors (product, sum, Nirmala, ABC, CAB, GA, harmonic, and misbalance prodeg), as well as Sombor- and Dharwad-type bond indices. We first present a unified edge–partition representation for any symmetric kernel, expressing each modified index as a finite sum over degree classes <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(E_{(a,b)}(G)\)</EquationSource> </InlineEquation>. This framework allows us to derive closed-form expressions for all sixteen modified bond-based indices on a broad collection of benchmark families: paths <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(P_{\textrm{n}}\)</EquationSource> </InlineEquation>, cycles <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\(C_{\textrm{n}}\)</EquationSource> </InlineEquation>, complete graphs <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\(K_{\textrm{n}}\)</EquationSource> </InlineEquation>, complete bipartite graphs <InlineEquation ID="IEq7"> <EquationSource Format="TEX">\(K_{m,\textrm{n}}\)</EquationSource> </InlineEquation>, stars <InlineEquation ID="IEq8"> <EquationSource Format="TEX">\(S_{\textrm{n}}\)</EquationSource> </InlineEquation>, friendship graphs <InlineEquation ID="IEq9"> <EquationSource Format="TEX">\(F_{\textrm{n}}\)</EquationSource> </InlineEquation>, wheels <InlineEquation ID="IEq10"> <EquationSource Format="TEX">\(W_{\textrm{n}}\)</EquationSource> </InlineEquation>, book graphs <InlineEquation ID="IEq11"> <EquationSource Format="TEX">\(B_{\textrm{n}}\)</EquationSource> </InlineEquation>, Dutch windmill graphs <InlineEquation ID="IEq12"> <EquationSource Format="TEX">\(D_{\textrm{n}}^{(m)}\)</EquationSource> </InlineEquation>, and hypercubes <InlineEquation ID="IEq13"> <EquationSource Format="TEX">\(Q_d\)</EquationSource> </InlineEquation>. The resulting tables reveal clear asymptotic growth patterns and highlight which structures are extremal for the modified descriptors. Moreover, we obtain sharp degree–extreme bounds for a representative subset of the indices in terms of the order <InlineEquation ID="IEq14"> <EquationSource Format="TEX">\(\textrm{n}\)</EquationSource> </InlineEquation>, size <i>m</i>, and the minimum and maximum degrees <InlineEquation ID="IEq15"> <EquationSource Format="TEX">\(\delta\)</EquationSource> </InlineEquation> and <InlineEquation ID="IEq16"> <EquationSource Format="TEX">\(\Delta\)</EquationSource> </InlineEquation>, with equality characterizing regular graphs. The proposed modified bond-based indices thus provide a flexible and analytically tractable family of descriptors that couple vertex and bond information in a novel way, and are well suited as structured features for modern chemoinformatics and graph-based machine-learning models on molecular graphs. Finally, to demonstrate predictive utility in a hypothesis-driven setting, we further benchmark these <InlineEquation ID="IEq17"> <EquationSource Format="TEX">\({}^{m}\textrm{BI}\)</EquationSource> </InlineEquation> descriptors within a large multi-task QSAR/QSPR pipeline on 3,219 ChEMBL antibacterial molecules across ten continuous properties using a heterogeneous model zoo under three descriptor scenarios, where the combined descriptors scenario achieves the best overall generalisation (Macro Test <InlineEquation ID="IEq18"> <EquationSource Format="TEX">\(R^2 = 0.861\)</EquationSource> </InlineEquation>; Global zRMSE <InlineEquation ID="IEq19"> <EquationSource Format="TEX">\(= 0.373\)</EquationSource> </InlineEquation>), improving upon the Physicochemical descriptors scenario (Macro Test <InlineEquation ID="IEq20"> <EquationSource Format="TEX">\(R^2 = 0.852\)</EquationSource> </InlineEquation>; Global zRMSE <InlineEquation ID="IEq21"> <EquationSource Format="TEX">\(= 0.385\)</EquationSource> </InlineEquation>).</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

From graph theory to chemoinformatics: modified bond-based indices and a hypothesis-driven multi-task QSAR/QSPR benchmark

  • Azzam Altairi,
  • Zaied Alhaj,
  • Mohammed Alsharafi,
  • Yusuf Zeren

摘要

Graph–theoretic degree–based descriptors play a central role in chemoinformatics and QSPR/QSAR modelling, yet most classical indices either focus purely on vertex degrees or treat bond contributions in a purely multiplicative way. In this work we introduce and systematically study a new family of modified bond-based indices in which each edge \(uv\in E(G)\) is weighted by a local bond factor \(\mathcal {T}(uv)={\phi _G(\textrm{u})}+{\phi _G(\textrm{v})}-2\) in the denominator, coupled with a vertex kernel in the numerator. This construction yields modified versions of the first and second Zagreb indices, the Forgotten and Yemen indices, several connectivity-type descriptors (product, sum, Nirmala, ABC, CAB, GA, harmonic, and misbalance prodeg), as well as Sombor- and Dharwad-type bond indices. We first present a unified edge–partition representation for any symmetric kernel, expressing each modified index as a finite sum over degree classes \(E_{(a,b)}(G)\) . This framework allows us to derive closed-form expressions for all sixteen modified bond-based indices on a broad collection of benchmark families: paths \(P_{\textrm{n}}\) , cycles \(C_{\textrm{n}}\) , complete graphs \(K_{\textrm{n}}\) , complete bipartite graphs \(K_{m,\textrm{n}}\) , stars \(S_{\textrm{n}}\) , friendship graphs \(F_{\textrm{n}}\) , wheels \(W_{\textrm{n}}\) , book graphs \(B_{\textrm{n}}\) , Dutch windmill graphs \(D_{\textrm{n}}^{(m)}\) , and hypercubes \(Q_d\) . The resulting tables reveal clear asymptotic growth patterns and highlight which structures are extremal for the modified descriptors. Moreover, we obtain sharp degree–extreme bounds for a representative subset of the indices in terms of the order \(\textrm{n}\) , size m, and the minimum and maximum degrees \(\delta\) and \(\Delta\) , with equality characterizing regular graphs. The proposed modified bond-based indices thus provide a flexible and analytically tractable family of descriptors that couple vertex and bond information in a novel way, and are well suited as structured features for modern chemoinformatics and graph-based machine-learning models on molecular graphs. Finally, to demonstrate predictive utility in a hypothesis-driven setting, we further benchmark these \({}^{m}\textrm{BI}\) descriptors within a large multi-task QSAR/QSPR pipeline on 3,219 ChEMBL antibacterial molecules across ten continuous properties using a heterogeneous model zoo under three descriptor scenarios, where the combined descriptors scenario achieves the best overall generalisation (Macro Test \(R^2 = 0.861\) ; Global zRMSE \(= 0.373\) ), improving upon the Physicochemical descriptors scenario (Macro Test \(R^2 = 0.852\) ; Global zRMSE \(= 0.385\) ).