Please use this identifier to cite or link to this item: https://scidar.kg.ac.rs/handle/123456789/9589
Full metadata record
DC FieldValueLanguage
dc.rights.licenseBY-NC-ND-
dc.contributor.authorDehmer M.-
dc.contributor.authorGrabner M.-
dc.contributor.authorFurtula, Boris-
dc.date.accessioned2020-09-19T18:39:12Z-
dc.date.available2020-09-19T18:39:12Z-
dc.date.issued2012-
dc.identifier.urihttps://scidar.kg.ac.rs/handle/123456789/9589-
dc.description.abstractIn chemistry and computational biology, structural graph descriptors have been proven essential for characterizing the structure of chemical and biological networks. It has also been demonstrated that they are useful to derive empirical models for structure-oriented drug design. However, from a more general (complex network-oriented) point of view, investigating mathematical properties of structural descriptors, such as their uniqueness and structural interpretation, is also important for an in-depth understanding of the underlying methods. In this paper, we emphasize the evaluation of the uniqueness of distance, degree and eigenvalue-based measures. Among these are measures that have been recently investigated extensively. We report numerical results using chemical and exhaustively generated graphs and also investigate correlations between the measures. © 2012 Dehmer et al.-
dc.rightsopenAccess-
dc.rights.urihttps://creativecommons.org/licenses/by-nc-nd/4.0/-
dc.sourcePLoS ONE-
dc.titleStructural discrimination of networks by using distance, degree and eigenvalue-based measures-
dc.typearticle-
dc.identifier.doi10.1371/journal.pone.0038564-
dc.identifier.scopus2-s2.0-84863691500-
Appears in Collections:Faculty of Science, Kragujevac

Page views(s)

122

Downloads(s)

7

Files in This Item:
File Description SizeFormat 
10.1371-journal.pone.0038564.pdf1.09 MBAdobe PDFThumbnail
View/Open


This item is licensed under a Creative Commons License Creative Commons