Please use this identifier to cite or link to this item: https://scidar.kg.ac.rs/handle/123456789/8272
Full metadata record
DC FieldValueLanguage
dc.rights.licenseBY-NC-ND-
dc.contributor.authorHayat U.-
dc.contributor.authorUmer M.-
dc.contributor.authorGutman, Ivan-
dc.contributor.authorDavvaz B.-
dc.contributor.authorNolla de Celis, Álvaro-
dc.date.accessioned2020-09-19T15:16:00Z-
dc.date.available2020-09-19T15:16:00Z-
dc.date.issued2019-
dc.identifier.urihttps://scidar.kg.ac.rs/handle/123456789/8272-
dc.description.abstract© 2019 Umar Hayat et al., published by De Gruyter 2019. A graph is said to be NSSD (=non-singular with a singular deck) if it has no eigenvalue equal to zero, whereas all its vertex-deleted subgraphs have eigenvalues equal to zero. NSSD graphs are of importance in the theory of conductance of organic compounds. In this paper, a novel method is described for constructing NSSD molecular graphs from the commuting graphs of the Hv-group. An algorithm is presented to construct the NSSD graphs from these commuting graphs.-
dc.rightsopenAccess-
dc.rights.urihttps://creativecommons.org/licenses/by-nc-nd/4.0/-
dc.sourceOpen Mathematics-
dc.titleA novel method to construct nssd molecular graphs-
dc.typearticle-
dc.identifier.doi10.1515/math-2019-0129-
dc.identifier.scopus2-s2.0-85078719717-
Appears in Collections:Faculty of Science, Kragujevac

Page views(s)

128

Downloads(s)

12

Files in This Item:
File Description SizeFormat 
10.1515-math-2019-0129.pdf628.01 kBAdobe PDFThumbnail
View/Open


This item is licensed under a Creative Commons License Creative Commons