A novel method to construct NSSD molecular graphs

From MaRDI portal
Publication:2189183




Abstract: 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.









This page was built for publication: A novel method to construct NSSD molecular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2189183)