Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/28362| Title: | No chemical graph on more than two vertices is nuciferous |
| Authors: | Sciriha, Irene Farrugia, Alexander |
| Keywords: | Mathematics -- Charts, diagrams, etc. Mathematics -- Problems, exercises, etc. |
| Issue Date: | 2016 |
| Publisher: | Drustvo Matematikov, Fizikov in Astronomov, Society of Mathematicians, Physicists and Astronomers |
| Citation: | Sciriha, I., & Farrugia, A. (2016). No chemical graph on more than two vertices is nuciferous. Ars Mathematica Contemporanea, 11(2), 397-402. |
| Abstract: | A simple graph is nuciferous if its 0–1 adjacency matrix is nonsingular and if its inverse has zero entries on its main diagonal and a non–zero entry at each off–diagonal position. A nuciferous graph is a molecular graph that represents an ipso omni–insulating but distinct omni–conducting molecule. It has been conjectured in 2012 that only K2, the complete graph on two vertices, is nuciferous. We show that this conjecture is true for chemical graphs, that is, graphs whose vertex degree is at most three. |
| URI: | https://www.um.edu.mt/library/oar//handle/123456789/28362 |
| ISSN: | 18553974 |
| Appears in Collections: | Scholarly Works - FacSciMat Scholarly Works - JCMath |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| No_chemical_graph_on_more_than_two_vertices_is_nuciferous_2016.pdf | 215.02 kB | Adobe PDF | View/Open |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.