Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/28151
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ali, Didar A. | - |
dc.contributor.author | Gauci, John Baptist | - |
dc.contributor.author | Sciriha, Irene | - |
dc.contributor.author | Sharaf, Khidir R. | - |
dc.date.accessioned | 2018-03-22T11:14:09Z | - |
dc.date.available | 2018-03-22T11:14:09Z | - |
dc.date.issued | 2016 | - |
dc.identifier.citation | Ali, D. A., Gauci, J. B., Sciriha, I., & Sharaf, K. R. (2016). Nullity of a graph with a cut-edge. MATCH Communications in Mathematical and in Computer Chemistry, 76, 771-791. | en_GB |
dc.identifier.issn | 03406253 | - |
dc.identifier.uri | https://www.um.edu.mt/library/oar//handle/123456789/28151 | - |
dc.description.abstract | The nullity of a graph is known to be an analytical tool to predict reactivity and conductivity of molecular π-systems. In this paper we consider the change in nullity when graphs with a cut-edge, and others derived from them, undergo geometrical operations. In particular, we consider the deletion of edges and vertices, the contraction of edges and the insertion of an edge at a coalescence vertex. We also derive three inequalities on the nullity of graphs along the same lines as the consequences of the Interlacing Theorem. These results shed light, in the tight-binding source and sink potential model, on the behaviour of molecular graphs which allow or bar conductivity in the cases when the connections are either distinct or ipso. | en_GB |
dc.language.iso | en | en_GB |
dc.publisher | Faculty of Science. University of Kragujevac | en_GB |
dc.rights | info:eu-repo/semantics/openAccess | en_GB |
dc.subject | Mathematics -- Charts, diagrams, etc. | en_GB |
dc.subject | Mathematics -- Problems, exercises, etc. | en_GB |
dc.title | Nullity of a graph with a cut-edge | en_GB |
dc.type | article | en_GB |
dc.rights.holder | The copyright of this work belongs to the author(s)/publisher. The rights of this work are as defined by the appropriate Copyright Legislation or as modified by any successive legislation. Users may access this work and can make use of the information contained in accordance with the Copyright Legislation provided that the author must be properly acknowledged. Further distribution or reproduction in any format is prohibited without the prior permission of the copyright holder. | en_GB |
dc.description.reviewed | peer-reviewed | en_GB |
dc.publication.title | MATCH Communications in Mathematical and in Computer Chemistry | en_GB |
Appears in Collections: | Scholarly Works - FacSciMat |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Nullity_of_a_graph_with_a_cut-edge_2016.PDF | 473.85 kB | Adobe PDF | View/Open |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.