<?xml version="1.0"?><rdf:RDF xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:edm="http://www.europeana.eu/schemas/edm/" xmlns:wgs84_pos="http://www.w3.org/2003/01/geo/wgs84_pos" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:rdaGr2="http://rdvocab.info/ElementsGr2" xmlns:oai="http://www.openarchives.org/OAI/2.0/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:ore="http://www.openarchives.org/ore/terms/" xmlns:skos="http://www.w3.org/2004/02/skos/core#" xmlns:dcterms="http://purl.org/dc/terms/"><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-TMZY3XQN/454df45d-fe17-4817-b372-ccf488eb2063/PDF"><dcterms:extent>343 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-TMZY3XQN/d7bf161c-f420-4cfc-b5ee-219b89766975/TEXT"><dcterms:extent>36 KB</dcterms:extent></edm:WebResource><edm:TimeSpan rdf:about="2008-2025"><edm:begin xml:lang="en">2008</edm:begin><edm:end xml:lang="en">2025</edm:end></edm:TimeSpan><edm:ProvidedCHO rdf:about="URN:NBN:SI:doc-TMZY3XQN"><dcterms:isPartOf rdf:resource="https://www.dlib.si/details/URN:NBN:SI:spr-UP1WMFAR" /><dcterms:issued>2019</dcterms:issued><dc:creator>Ali, Didar A.</dc:creator><dc:creator>Gauci, John Baptist</dc:creator><dc:creator>Sciriha, Irene</dc:creator><dc:creator>Sharaf, Khidir R.</dc:creator><dc:format xml:lang="sl">številka:1</dc:format><dc:format xml:lang="sl">letnik:16</dc:format><dc:format xml:lang="sl">str. 141-155</dc:format><dc:identifier>ISSN:1855-3966</dc:identifier><dc:identifier>COBISSID_HOST:18704473</dc:identifier><dc:identifier>URN:URN:NBN:SI:doc-TMZY3XQN</dc:identifier><dc:language>en</dc:language><dc:publisher xml:lang="sl">Univerza na Primorskem, Fakulteta za matematiko, naravoslovje in informacijske tehnologije</dc:publisher><dcterms:isPartOf xml:lang="sl">Ars mathematica contemporanea</dcterms:isPartOf><dc:subject xml:lang="en">circuit</dc:subject><dc:subject xml:lang="en">core vertices</dc:subject><dc:subject xml:lang="en">key-graphs</dc:subject><dc:subject xml:lang="sl">ključni grafi</dc:subject><dc:subject xml:lang="sl">ničnost</dc:subject><dc:subject xml:lang="en">nullity</dc:subject><dc:subject xml:lang="sl">prekrivanje</dc:subject><dc:subject xml:lang="en">superimposition</dc:subject><dc:subject xml:lang="sl">vezje</dc:subject><dc:subject xml:lang="sl">vozlišča sredice</dc:subject><dcterms:temporal rdf:resource="2008-2025" /><dc:title xml:lang="sl">The conductivity of superimposed key-graphs with a common one-dimensional adjacency nullspace|</dc:title><dc:description xml:lang="sl">Two connected labelled graphs ?$H_1$? and ?$H_2$? of nullity one, with identical one-vertex deleted subgraphs ?$H_1 - z_1$? and ?$H_2 - z_2$? 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 ?$H_1 + z_2$? and also ?$H_2 + z_1$? whereas ?$Z + e$? is obtained from ?$Z$? by adding the edge ?$\{z_1, z_2\}$?. 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</dc:description><dc:description xml:lang="sl">Dva povezana označena grafa ?$H_1$? in ?$H_2$? ničnosti ena, z identičnima podgrafoma ?$H_1 - z_1$? in ?$H_2 - z_2$?, dobljenima iz njiju z izbrisom po enega vozlišča, in s skupnim lastnim vektorjem v jedru njune 0-1 matrike sosednosti, lahko sopostavimo tako, da dobimo prekrivanje ?$Z$?. Graf ?$Z$? je tako ?$H_1 + z_2$? kot ?$H_2 + z_1$? medtem ko je graf ?$Z + e$? dobljen iz ?$Z$? z dodajanjem povezave ?$\{z_1, z_2\}$?. Pokažemo, da ničnost grafa ?$Z$? ne more zavzeti vseh vrednosti, ki jih dovoljuje prepletanje. Predlagamo klasifikacijo grafov z dvema izbranima vozliščema glede na vrsto dobljenih vozlišč z uporabo 3-znakovne kode. Izmed 27 vrednosti, ki jih lahko zavzame, jih je samo 9 hipotetično mogočih za ?$Z$?, in za 8 od njih vemo, da obstajajo. Poleg tega, molekulski model SSP napoveduje prevodnost ali izolacijo na Fermijevi ravni energije za 11 možnih tipov sestavov, zgrajenih iz molekule in dveh predpisanih veznih atomov nad majhno pristransko napetostjo. Vseh 11 tipov molekulskih sestavov se da realizirati za splošne molekule, vendar strukturi grafov ?$Z$? in ?$Z + e$? omejujeta to število na samo 5</dc:description><edm:type>TEXT</edm:type><dc:type xml:lang="sl">znanstveno časopisje</dc:type><dc:type xml:lang="en">journals</dc:type><dc:type rdf:resource="http://www.wikidata.org/entity/Q361785" /></edm:ProvidedCHO><ore:Aggregation rdf:about="http://www.dlib.si/?URN=URN:NBN:SI:doc-TMZY3XQN"><edm:aggregatedCHO rdf:resource="URN:NBN:SI:doc-TMZY3XQN" /><edm:isShownBy rdf:resource="http://www.dlib.si/stream/URN:NBN:SI:doc-TMZY3XQN/454df45d-fe17-4817-b372-ccf488eb2063/PDF" /><edm:rights rdf:resource="http://creativecommons.org/licenses/by/4.0/" /><edm:provider>Slovenian National E-content Aggregator</edm:provider><edm:intermediateProvider xml:lang="en">National and University Library of Slovenia</edm:intermediateProvider><edm:dataProvider xml:lang="sl">Univerza na Primorskem, Fakulteta za naravoslovje, matematiko in informacijske tehnologije</edm:dataProvider><edm:object rdf:resource="http://www.dlib.si/streamdb/URN:NBN:SI:doc-TMZY3XQN/maxi/edm" /><edm:isShownAt rdf:resource="http://www.dlib.si/details/URN:NBN:SI:doc-TMZY3XQN" /></ore:Aggregation></rdf:RDF>