<?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-1MNBF4KI/42b5fda8-9246-49e2-8b86-76e0c2260a1f/PDF"><dcterms:extent>352 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-1MNBF4KI/bcf176ae-c9fa-4f64-b909-6876b94c30e0/TEXT"><dcterms:extent>27 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-1MNBF4KI"><dcterms:isPartOf rdf:resource="https://www.dlib.si/details/URN:NBN:SI:spr-UP1WMFAR" /><dcterms:issued>2019</dcterms:issued><dc:creator>Stanić, Zoran</dc:creator><dc:format xml:lang="sl">številka:1</dc:format><dc:format xml:lang="sl">letnik:17</dc:format><dc:format xml:lang="sl">str. 103-114</dc:format><dc:identifier>ISSN:1855-3966</dc:identifier><dc:identifier>COBISSID_HOST:18952793</dc:identifier><dc:identifier>URN:URN:NBN:SI:doc-1MNBF4KI</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">adjacency matrix</dc:subject><dc:subject xml:lang="sl">matrika sosednosti</dc:subject><dc:subject xml:lang="en">net-balanced signed graph</dc:subject><dc:subject xml:lang="sl">neto-uravnoteženi predznačeni grafi</dc:subject><dc:subject xml:lang="sl">predznačeni graf</dc:subject><dc:subject xml:lang="sl">preklopno ekvivalentni predznačeni grafi</dc:subject><dc:subject xml:lang="en">signed graph</dc:subject><dc:subject xml:lang="en">switching equivalent signed graphs</dc:subject><dcterms:temporal rdf:resource="2008-2025" /><dc:title xml:lang="sl">Integral regular net-balanced signed graphs with vertex degree at most four|</dc:title><dc:description xml:lang="sl">A signed graph is called integral if its spectrum consists entirely of integers, it is ?$r$?-regular if its underlying graph is regular of degree ?$r$?, and it is net-balanced if the difference between positive and negative vertex degree is a constant on the vertex set (this constant is called the net-balance and denoted ?$\varrho$?). We determine all the connected integral 3-regular net-balanced signed graphs. In the next natural step, for ?$r = 4$?, we consider only those whose net-balance is a simple eigenvalue. There, we complete the list of feasible spectra in bipartite case for ?$\varrho \neq 0$? and prove the non-existence for ?$\varrho = 0$?. Certain existence conditions are established and the existence of some 4-regular (simple) graphs is confirmed. In this study we transferred some results from the theory of graph spectra; in particular, we give a counterpart to the Hoffman polynomial</dc:description><dc:description xml:lang="sl">Predznačeni graf se imenuje celoštevilski, če njegov spekter sestoji izključno iz celih števil, ?$r$?-regularen, če je njegov temeljni graf regularen stopnje ?$r$?, in neto-uravnotežen, če je je razlika med pozitivno in negativno vozliščno stopnjo konstanta na množici vozlišč (ta konstanta, ki jo oznacimo z ?$\varrho$?, se imenuje neto-uravnoteženost). Določimo vse povezane celoštevilske 3-regularne neto-uravnotežene predznačene grafe. V naslednjem naravnem koraku, za ?$r = 4$?, obravnavamo samo tiste predznačene grafe, katerih neto-uravnoteženost je enostavna lastna vrednost. Pri slednjih dopolnimo seznam dopustnih spektrov v dvodelnem primeru pri ?$\varrho \neq 0$? ter dokažemo neobstoj pri ?$\varrho = 0$?. Dobimo določene eksistenčne pogoje in potrdimo obstoj nekaterih 4-regularnih (enostavnih) grafov. Pri tej raziskavi nekatere rezultate iz spektralne teorije grafov smiselno prenesemo v naš kontekst. Konkretneje, podamo ustrezen analog Hoffmanovemu polinomu</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-1MNBF4KI"><edm:aggregatedCHO rdf:resource="URN:NBN:SI:doc-1MNBF4KI" /><edm:isShownBy rdf:resource="http://www.dlib.si/stream/URN:NBN:SI:doc-1MNBF4KI/42b5fda8-9246-49e2-8b86-76e0c2260a1f/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-1MNBF4KI/maxi/edm" /><edm:isShownAt rdf:resource="http://www.dlib.si/details/URN:NBN:SI:doc-1MNBF4KI" /></ore:Aggregation></rdf:RDF>