The complementary distance matrix, a new molecular graph metric

被引:0
|
作者
Ivanciuc, O [1 ]
Ivanciuc, T [1 ]
Balaban, AT [1 ]
机构
[1] Univ Politehnica Bucharest, Fac Chem Technol, Dept Organ Chem, Bucharest 78100, Romania
来源
ACH-MODELS IN CHEMISTRY | 2000年 / 137卷 / 01期
关键词
D O I
暂无
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
Structural descriptors computed from the molecular graph are widely used in developing structure-property models, in drug design, virtual synthesis, chemical database searching, similarity and diversity assessment. Because there is a considerable interest in deriving additional structural descriptors For QSPR and QSAR models, we introduce in this paper the complementary distance matrix, CD, that represents a new molecular graph metric derived from graph distances. Using a formula which is equivalent to that used to compute the reciprocal distance matrix RD. we define the reciprocal complementary distance matrix RCD; in the QSPR models, the descriptors derived from the RCD matrix outperform those obtained from the CD matrix. The graph structural descriptors computed with the new molecular matrices are used to develop structure-property models for the boiling temperature, molar heat capacity, standard Gibbs energy of formation, vaporization enthalpy, refractive index, and density of 134 alkanes C-6-C-10.
引用
收藏
页码:57 / 82
页数:26
相关论文
共 50 条
  • [31] An inverse formula for the distance matrix of a fan graph
    Hao, Chan
    Li, Shuchao
    Zhang, Licheng
    LINEAR & MULTILINEAR ALGEBRA, 2022, 70 (22): : 7807 - 7824
  • [32] The inertia and energy of the distance matrix of a connected graph
    Lin, Huiqiu
    Liu, Ruifang
    Lu, Xiwen
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2015, 467 : 29 - 39
  • [33] On the spread of the distance signless Laplacian matrix of a graph
    Pirzada, S.
    Haq, Mohd Abrar Ul
    ACTA UNIVERSITATIS SAPIENTIAE INFORMATICA, 2023, 15 (01) : 38 - 45
  • [34] On the largest eigenvalue of the distance matrix of a connected graph
    Zhou, Bo
    Trinajstic, Nenad
    CHEMICAL PHYSICS LETTERS, 2007, 447 (4-6) : 384 - 387
  • [35] Distance Metric Learning for Semantic Segmentation based Graph Hashing
    Hu, Haifeng
    Xu, Xiangfeng
    Wu, Jiansheng
    PROCEEDINGS OF 2018 TENTH INTERNATIONAL CONFERENCE ON ADVANCED COMPUTATIONAL INTELLIGENCE (ICACI), 2018, : 109 - 115
  • [36] Computing a metric basis of a bipartite distance-hereditary graph
    Moscarini, Marina
    THEORETICAL COMPUTER SCIENCE, 2022, 900 : 20 - 24
  • [37] Feature Space Distance Metric Learning for Discriminant Graph Embedding
    Li, Bo
    Fan, Zhang-Tao
    Zhang, Xiao-Long
    2016 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN), 2016, : 3608 - 3613
  • [38] Learning matrix factorization with scalable distance metric and regularizer
    Wang, Shiping
    Zhang, Yunhe
    Lin, Xincan
    Su, Lichao
    Xiao, Guobao
    Zhu, William
    Shi, Yiqing
    NEURAL NETWORKS, 2023, 161 : 254 - 266
  • [39] A Group Commutator Involving the Last Distance Matrix and Dual Distance Matrix of a Q-Polynomial Distance-Regular Graph: The Hamming Graph Case
    Siwaporn Mamart
    Graphs and Combinatorics, 2018, 34 : 803 - 817