Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/28151
Title: | Nullity of a graph with a cut-edge |
Authors: | Ali, Didar A. Gauci, John Baptist Sciriha, Irene Sharaf, Khidir R. |
Keywords: | Mathematics -- Charts, diagrams, etc. Mathematics -- Problems, exercises, etc. |
Issue Date: | 2016 |
Publisher: | Faculty of Science. University of Kragujevac |
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. |
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. |
URI: | https://www.um.edu.mt/library/oar//handle/123456789/28151 |
ISSN: | 03406253 |
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.