A novel method to construct nssd molecular graphs

Please use this identifier to cite or link to this item: https://scidar.kg.ac.rs/handle/123456789/8272

Full metadata record

DC Field	Value	Language
dc.rights.license	openAccess	-
dc.contributor.author	Hayat U.	-
dc.contributor.author	Umer M.	-
dc.contributor.author	Gutman, Ivan	-
dc.contributor.author	Davvaz B.	-
dc.contributor.author	Nolla de Celis, Álvaro	-
dc.date.accessioned	2020-09-19T15:16:00Z	-
dc.date.available	2020-09-19T15:16:00Z	-
dc.date.issued	2019	-
dc.identifier.uri	https://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.rights	info:eu-repo/semantics/openAccess	-
dc.rights.uri	https://creativecommons.org/licenses/by-nc-nd/4.0/	-
dc.source	Open Mathematics	-
dc.title	A novel method to construct nssd molecular graphs	-
dc.type	article	-
dc.identifier.doi	10.1515/math-2019-0129	-
dc.identifier.scopus	2-s2.0-85078719717	-
Appears in Collections:	Faculty of Science, Kragujevac