A novel method to construct NSSD molecular graphs

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

Full description

Saved in:

Bibliographic Details
Published in:	Open mathematics (Warsaw, Poland) Vol. 17; no. 1; pp. 1526 - 1537
Main Authors:	Hayat, Umar, Umer, Mubasher, Gutman, Ivan, Davvaz, Bijan, de Celis, Álvaro Nolla
Format:	Journal Article
Language:	English
Published:	Warsaw De Gruyter 26-12-2019 De Gruyter Poland
Subjects:	20N20 Algorithms commuting graph Eigenvalues Graph theory Graphs group hv-group non-singular graph with singular deck Organic compounds
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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.
ISSN:	2391-5455 2391-5455
DOI:	10.1515/math-2019-0129