A novel method to construct NSSD molecular graphs

DOI10.1515/MATH-2019-0129zbMATH Open1435.05129arXiv1910.12218OpenAlexW2997872167MaRDI QIDQ2189183FDOQ2189183

Authors: Umar Hayat, Mubasher Umer, Ivan Gutman, Bijan Davvaz, Álvaro Nolla de Celis 

Publication date: 15 June 2020

Published in: Open Mathematics (Search for Journal in Brave)

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 $H_v$-group. An algorithm is presented to construct the NSSD graphs from these commuting graphs.

Full work available at URL: https://arxiv.org/abs/1910.12218

Recommendations

• Edge construction of molecular NSSDs
• Generation of molecular graphs based on flexible utilization of the available structural information
• scientific article; zbMATH DE number 1890104
• scientific article; zbMATH DE number 614365
• scientific article; zbMATH DE number 1522766
• Algorithmic generation of molecular graphs with large Merrifield-Simmons index
• scientific article; zbMATH DE number 767672
• Constrained generation of molecular graphs
• Publication:4941277
• Graph construction and random graph generation for modeling protein structures

zbMATH Keywords

commuting graph\(H_v\)-groupnon-singular graph with singular deck

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Cites Work

• An introduction to the theory of graph spectra
• Title not available (Why is that?)
• The zero-divisor graph of a commutative ring
• Title not available (Why is that?)
• Non-commuting graph of a group.
• The total graph of a commutative ring
• Title not available (Why is that?)
• Topological approach to the chemistry of conjugated molecules
• The connectivity of commuting graphs
• Title not available (Why is that?)
• Join space graphs
• Graphs with a common eigenvalue deck
• On the inverse of the adjacency matrix of a graph
• Title not available (Why is that?)
• Edge construction of molecular NSSDs
• Non-singular graphs with a singular deck
• Triangles in inverse NSSD graphs

Cited In (1)

• Certain properties of the enhanced power graph associated with a finite group

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)