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...
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2019-12-01
|
Series: | Open Mathematics |
Subjects: | |
Online Access: | https://doi.org/10.1515/math-2019-0129 |
id |
doaj-43d3844529354cb6bfb065827d3499d1 |
---|---|
record_format |
Article |
spelling |
doaj-43d3844529354cb6bfb065827d3499d12021-09-06T19:20:11ZengDe GruyterOpen Mathematics2391-54552019-12-011711526153710.1515/math-2019-0129math-2019-0129A novel method to construct NSSD molecular graphsHayat Umar0Umer Mubasher1Gutman Ivan2Davvaz Bijan3de Celis Álvaro Nolla4Department of Mathematics, Quaid-i-Azam University, Islamabad, PakistanDepartment of Mathematics, Quaid-i-Azam University, Islamabad, PakistanFaculty of Science, University of Kragujevac, P. O. Box 60, 34000, Kragujevac, SerbiaDepartment of Mathematics, Yazd University, Yazd, IranFaculty of Teacher Training, Universidad Autonoma of Madrid, Madrid, SpainA 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.https://doi.org/10.1515/math-2019-0129hv-groupcommuting graphnon-singular graph with singular deck20n20 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Hayat Umar Umer Mubasher Gutman Ivan Davvaz Bijan de Celis Álvaro Nolla |
spellingShingle |
Hayat Umar Umer Mubasher Gutman Ivan Davvaz Bijan de Celis Álvaro Nolla A novel method to construct NSSD molecular graphs Open Mathematics hv-group commuting graph non-singular graph with singular deck 20n20 |
author_facet |
Hayat Umar Umer Mubasher Gutman Ivan Davvaz Bijan de Celis Álvaro Nolla |
author_sort |
Hayat Umar |
title |
A novel method to construct NSSD molecular graphs |
title_short |
A novel method to construct NSSD molecular graphs |
title_full |
A novel method to construct NSSD molecular graphs |
title_fullStr |
A novel method to construct NSSD molecular graphs |
title_full_unstemmed |
A novel method to construct NSSD molecular graphs |
title_sort |
novel method to construct nssd molecular graphs |
publisher |
De Gruyter |
series |
Open Mathematics |
issn |
2391-5455 |
publishDate |
2019-12-01 |
description |
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. |
topic |
hv-group commuting graph non-singular graph with singular deck 20n20 |
url |
https://doi.org/10.1515/math-2019-0129 |
work_keys_str_mv |
AT hayatumar anovelmethodtoconstructnssdmoleculargraphs AT umermubasher anovelmethodtoconstructnssdmoleculargraphs AT gutmanivan anovelmethodtoconstructnssdmoleculargraphs AT davvazbijan anovelmethodtoconstructnssdmoleculargraphs AT decelisalvaronolla anovelmethodtoconstructnssdmoleculargraphs AT hayatumar novelmethodtoconstructnssdmoleculargraphs AT umermubasher novelmethodtoconstructnssdmoleculargraphs AT gutmanivan novelmethodtoconstructnssdmoleculargraphs AT davvazbijan novelmethodtoconstructnssdmoleculargraphs AT decelisalvaronolla novelmethodtoconstructnssdmoleculargraphs |
_version_ |
1717777152174194688 |