DC Field | Value | Language |
---|---|---|

dc.contributor.author | Stevanović, Sanja | en |

dc.contributor.author | Stevanović, Dragan | en |

dc.date.accessioned | 2020-05-01T20:12:57Z | - |

dc.date.available | 2020-05-01T20:12:57Z | - |

dc.date.issued | 2018-01-01 | en |

dc.identifier.issn | 0340-6253 | en |

dc.identifier.uri | http://researchrepository.mi.sanu.ac.rs/handle/123456789/1230 | - |

dc.description.abstract | Distance-based topological indices have been used in studies of molecular graphs ever since Harry Wiener introduced his now famous index back in the 1940s, with tens of such indices studied actively in current mathematical chemistry literature. Interestingly, two further distance-based invariants, the difference factor and the intelligibility, have been used in parallel in studies of graphs associated to building and urban plans since the 1970s as well. These invariants are defined in terms of integration values that represent normalized values of the sums of distances from a given vertex to all other vertices in a graph. The difference factor is defined as an entropic measure that quantifies the diversity of the sequence of integration values, while the intelligibility is defined as the Pearson correlation coefficient between sequences of vertex degrees and integration values thus quantifying the extent to which integration values, for which one has to know the structure of the whole graph, can be predicted from vertex degrees, for which one has to know only how many neighbors a vertex has. We perform here a number of computational studies of the difference factor and the intelligibility that reveal to what extent these invariants can be used as topological indices in mathematical chemistry as well. | en |

dc.publisher | Faculty of Science, University of Kragujevac | - |

dc.relation | Graph theory and mathematical programming with applications in chemistry and computer science | - |

dc.relation.ispartof | Match | en |

dc.title | On distance-based topological indices used in architectural research | en |

dc.type | Article | en |

dc.identifier.scopus | 2-s2.0-85043508526 | en |

dc.relation.firstpage | 659 | en |

dc.relation.lastpage | 683 | en |

dc.relation.issue | 3 | en |

dc.relation.volume | 79 | en |

dc.description.rank | M21a | - |

item.openairetype | Article | - |

item.cerifentitytype | Publications | - |

item.fulltext | No Fulltext | - |

item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |

item.grantfulltext | none | - |

crisitem.author.orcid | 0000-0001-7723-3417 | - |

crisitem.author.orcid | 0000-0003-2908-305X | - |

crisitem.project.projectURL | http://www.mi.sanu.ac.rs/novi_sajt/research/projects/174033e.php | - |

crisitem.project.fundingProgram | Directorate for Computer & Information Science & Engineering | - |

crisitem.project.openAire | info:eu-repo/grantAgreement/NSF/Directorate for Computer & Information Science & Engineering/1740333 | - |

#### SCOPUS^{TM}

Citations

3
checked on Jun 15, 2024

#### Page view(s)

44
checked on May 9, 2024

#### Google Scholar^{TM}

Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.