DIKUL - logo
(UL)
  • Chemical graphs with the minimum value of Wiener index
    Knor, Martin ; Škrekovski, Riste ; Tepeh, Aleksandra
    Wiener index, defined as the sum of distances between all unordered pairs of vertices in a graph, is one of the oldest and the most popular molecular descriptors. In the paper, we would like to point ... to an "overlooked" problem of determining the minimum value of this index and corresponding extremes among chemical graphs with prescribed number of vertices. It turned out that the problem is far from tractable, and surprisingly related to the cages and the famous degree-diameter problem. Thus, for example, the Petersen graph, the Flower snark ▫$J_5$▫, the Heawood graph, and other highly symmetric graphs are encountered as extremes. In the paper, we give some remarks regarding this problem.
    Vir: Match : communications in mathematical and in computer chemistry. - ISSN 0340-6253 (Vol. 81, no. 1, 2019, str. 119-132)
    Vrsta gradiva - članek, sestavni del ; neleposlovje za odrasle
    Leto - 2019
    Jezik - angleški
    COBISS.SI-ID - 2048566291

    Povezava(-e):

    http://match.pmf.kg.ac.rs/electronic_versions/Match81/n1/match81n1_119-132.pdf

Vnos na polico