The conductivity of superimposed key-graphs with a common one-dimensional adjacency nullspace
Ars Mathematica Contemporanea, Tome 16 (2019) no. 1, pp. 141-155.

Voir la notice de l'article provenant de la source Ars Mathematica Contemporanea website

Two connected labelled graphs H1 and H2 of nullity one, with identical one-vertex deleted subgraphs H1 − z1 and H2 − z2 and having a common eigenvector in the nullspace of their 0-1 adjacency matrix, can be overlaid to produce the superimposition Z. The graph Z is H1 + z2 and also H2 + z1 whereas Z + e is obtained from Z by adding the edge {z1, z2}. We show that the nullity of Z cannot take all the values allowed by interlacing. We propose to classify graphs with two chosen vertices according to the type of the vertices occurring by using a 3-type-code. Out of the 27 values it can take, only 9 are hypothetically possible for Z, 8 of which are known to exist. Moreover, the SSP molecular model predicts conduction or insulation at the Fermi level of energy for 11 possible types of devices consisting of a molecule and two prescribed connecting atoms over a small bias voltage. All 11 molecular device types are realizable for general molecules, but the structure of Z and of Z + e restricts the number to just 5.
DOI : 10.26493/1855-3974.1460.fd6
Keywords: Nullity, core vertices, key-graphs, superimposition, circuit
@article{10_26493_1855_3974_1460_fd6,
     author = {Irene Sciriha and Didar A. Ali and John Baptist Gauci and Khidir R. Sharaf},
     title = {The conductivity of superimposed key-graphs with a common one-dimensional adjacency nullspace},
     journal = {Ars Mathematica Contemporanea},
     pages = {141--155},
     publisher = {mathdoc},
     volume = {16},
     number = {1},
     year = {2019},
     doi = {10.26493/1855-3974.1460.fd6},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.26493/1855-3974.1460.fd6/}
}
TY  - JOUR
AU  - Irene Sciriha
AU  - Didar A. Ali
AU  - John Baptist Gauci
AU  - Khidir R. Sharaf
TI  - The conductivity of superimposed key-graphs with a common one-dimensional adjacency nullspace
JO  - Ars Mathematica Contemporanea
PY  - 2019
SP  - 141
EP  - 155
VL  - 16
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.26493/1855-3974.1460.fd6/
DO  - 10.26493/1855-3974.1460.fd6
LA  - en
ID  - 10_26493_1855_3974_1460_fd6
ER  - 
%0 Journal Article
%A Irene Sciriha
%A Didar A. Ali
%A John Baptist Gauci
%A Khidir R. Sharaf
%T The conductivity of superimposed key-graphs with a common one-dimensional adjacency nullspace
%J Ars Mathematica Contemporanea
%D 2019
%P 141-155
%V 16
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.26493/1855-3974.1460.fd6/
%R 10.26493/1855-3974.1460.fd6
%G en
%F 10_26493_1855_3974_1460_fd6
Irene Sciriha; Didar A. Ali; John Baptist Gauci; Khidir R. Sharaf. The conductivity of superimposed key-graphs with a common one-dimensional adjacency nullspace. Ars Mathematica Contemporanea, Tome 16 (2019) no. 1, pp. 141-155. doi : 10.26493/1855-3974.1460.fd6. http://geodesic.mathdoc.fr/articles/10.26493/1855-3974.1460.fd6/

Cité par Sources :