{"?xml":{"@version":"1.0"},"edm: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-UAR9RMEZ/ed80021d-af31-47fc-91a4-e4cb5dfa8cf7/PDF","dcterms:extent":"300 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-UAR9RMEZ/1fbc75e4-a478-40e3-bcc3-698b798b5055/TEXT","dcterms:extent":"30 KB"}],"edm:TimeSpan":{"@rdf:about":"2008-2025","edm:begin":{"@xml:lang":"en","#text":"2008"},"edm:end":{"@xml:lang":"en","#text":"2025"}},"edm:ProvidedCHO":{"@rdf:about":"URN:NBN:SI:doc-UAR9RMEZ","dcterms:isPartOf":[{"@rdf:resource":"https://www.dlib.si/details/URN:NBN:SI:spr-UP1WMFAR"},{"@xml:lang":"sl","#text":"Ars mathematica contemporanea"}],"dcterms:issued":"2016","dc:creator":["Farrugia, Alexander","Gauci, John Baptist","Sciriha, Irene"],"dc:format":[{"@xml:lang":"sl","#text":"letnik:11"},{"@xml:lang":"sl","#text":"številka:2"},{"@xml:lang":"sl","#text":"str. 231-245"}],"dc:identifier":["COBISSID:17854553","ISSN:1855-3966","URN:URN:NBN:SI:doc-UAR9RMEZ"],"dc:language":"en","dc:publisher":{"@xml:lang":"sl","#text":"Univerza na Primorskem, Fakulteta za matematiko, naravoslovje in informacijske tehnologije"},"dc:subject":[{"@xml:lang":"en","#text":"circulant matrix"},{"@xml:lang":"sl","#text":"cirkulantna matrika"},{"@xml:lang":"en","#text":"complete graph"},{"@xml:lang":"sl","#text":"G-matični graf"},{"@xml:lang":"en","#text":"G-nutful graph"},{"@xml:lang":"sl","#text":"NSSD"},{"@xml:lang":"sl","#text":"polni graf"}],"dcterms:temporal":{"@rdf:resource":"2008-2025"},"dc:title":{"@xml:lang":"sl","#text":"Complete graphs with zero diagonal inverse|"},"dc:description":[{"@xml:lang":"sl","#text":"If the inverse of a non-singular real symmetric matrix that represents an edge-weighted graph with no loops has zero diagonal, then the inverse itself is the matrix of a loopless graph. Here we show that such graphs having non-zero weight on each edge always exist if their number of vertices is at least 6"},{"@xml:lang":"sl","#text":"Če ima inverz nesingularne realne simetrične matrike, ki predstavlja povezavno utežen graf brez zank, ničelno diagonalo, potem je inverz sam matrika grafa brez zank. Tukaj pokažemo, da takšni grafi, ki imajo neničelno utež na vsaki povezavi, vselej obstajajo, če je njihovo število vozlišč najmanj 6"}],"edm:type":"TEXT","dc:type":[{"@xml:lang":"sl","#text":"znanstveno časopisje"},{"@xml:lang":"en","#text":"journals"},{"@rdf:resource":"http://www.wikidata.org/entity/Q361785"}]},"ore:Aggregation":{"@rdf:about":"http://www.dlib.si/?URN=URN:NBN:SI:doc-UAR9RMEZ","edm:aggregatedCHO":{"@rdf:resource":"URN:NBN:SI:doc-UAR9RMEZ"},"edm:isShownBy":{"@rdf:resource":"http://www.dlib.si/stream/URN:NBN:SI:doc-UAR9RMEZ/ed80021d-af31-47fc-91a4-e4cb5dfa8cf7/PDF"},"edm:rights":{"@rdf:resource":"http://creativecommons.org/licenses/by/4.0/"},"edm:provider":"Slovenian National E-content Aggregator","edm:intermediateProvider":{"@xml:lang":"en","#text":"National and University Library of Slovenia"},"edm:dataProvider":{"@xml:lang":"sl","#text":"Univerza na Primorskem, Fakulteta za naravoslovje, matematiko in informacijske tehnologije"},"edm:object":{"@rdf:resource":"http://www.dlib.si/streamdb/URN:NBN:SI:doc-UAR9RMEZ/maxi/edm"},"edm:isShownAt":{"@rdf:resource":"http://www.dlib.si/details/URN:NBN:SI:doc-UAR9RMEZ"}}}}