A novel method to construct NSSD molecular graphs
Open Access
- 26 December 2019
- journal article
- research article
- Published by Walter de Gruyter GmbH in Open Mathematics
- Vol. 17 (1) , 1526-1537
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.Keywords
All Related Versions
This publication has 18 references indexed in Scilit:
- Omni-conducting and omni-insulating moleculesThe Journal of Chemical Physics, 2014
- Graphs with a common eigenvalue deckLinear Algebra and its Applications, 2009
- The total graph of a commutative ringJournal of Algebra, 2008
- Graph theory and molecular orbitals2007
- The connectivity of commuting graphsJournal of Combinatorial Theory, Series A, 2006
- Non-commuting graph of a groupJournal of Algebra, 2006
- The Zero-Divisor Graph of a Commutative RingJournal of Algebra, 1999
- Join space graphsJournal of Geometry, 1988
- Cyclic conjugation and the hückel molecular orbital modelTheoretical Chemistry Accounts, 1981
- Graphical studies on the relations between the structure and reactivity of conjugated systems: the role of non-bonding molecular orbitalsJournal of Molecular Structure, 1975