A Novel Method to Construct NSSD Molecular Graphs
Combinatorics
2019-10-29 v1
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 -group. An algorithm is presented to construct the NSSD graphs from these commuting graphs.
Keywords
Cite
@article{arxiv.1910.12218,
title = {A Novel Method to Construct NSSD Molecular Graphs},
author = {Umar Hayat and Mubasher Umer and Ivan Gutman and Bijan Davvaz and Álvaro Nolla de Celis},
journal= {arXiv preprint arXiv:1910.12218},
year = {2019}
}