<?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-VMNABAYY/644d29cf-22ce-4e06-8414-91071469aafc/PDF"><dcterms:extent>420 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-VMNABAYY/2847cdd5-9369-4a8f-b409-4cbe97397379/TEXT"><dcterms:extent>48 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-VMNABAYY/79ef8389-7f95-4c74-ba06-b4bde373b8bb/PDF"><dcterms:extent>95 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-VMNABAYY/37ff83bc-085f-459a-9935-30a01bb1106f/TEXT"><dcterms:extent>3 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-VMNABAYY"><dcterms:isPartOf rdf:resource="https://www.dlib.si/details/URN:NBN:SI:spr-UP1WMFAR" /><dcterms:issued>2023</dcterms:issued><dc:creator>Belardo, Francesco</dc:creator><dc:creator>Stanić, Zoran</dc:creator><dc:creator>Zaslavsky, Thomas</dc:creator><dc:format xml:lang="sl">številka:1</dc:format><dc:format xml:lang="sl">letnik:23</dc:format><dc:format xml:lang="sl">art. P1.02 (17 str.)</dc:format><dc:identifier>DOI:10.26493/1855-3974.2842.6b5</dc:identifier><dc:identifier>COBISSID_HOST:143663363</dc:identifier><dc:identifier>ISSN:1855-3966</dc:identifier><dc:identifier>URN:URN:NBN:SI:doc-VMNABAYY</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">bidirected graph</dc:subject><dc:subject xml:lang="en">Cartesian product graph</dc:subject><dc:subject xml:lang="sl">dvosmerni graf</dc:subject><dc:subject xml:lang="sl">graf kartezičnega produkta</dc:subject><dc:subject xml:lang="en">graph eigenvalues</dc:subject><dc:subject xml:lang="sl">lastne vrednosti grafa</dc:subject><dc:subject xml:lang="sl">pravilni predznačeni graf</dc:subject><dc:subject xml:lang="sl">predznačeni graf povezav</dc:subject><dc:subject xml:lang="sl">predznačeni združeni graf</dc:subject><dc:subject xml:lang="en">regular signed graph</dc:subject><dc:subject xml:lang="en">signed line graph</dc:subject><dc:subject xml:lang="en">signed total graph</dc:subject><dcterms:temporal rdf:resource="2008-2025" /><dc:title xml:lang="sl">Total graph of a signed graph|</dc:title><dc:description xml:lang="sl">In this paper we introduce a product-like operation that generalizes the construction of the generalized Sierpiński graphs. Let The total graph is built by joining the graph to its line graph by means of the incidences. We introduce a similar construction for signed graphs. Under two similar defnitions of the line signed graph, we defne the corresponding total signed graph and we show that it is stable under switching. We consider balance, the frustration index and frustration number, and the largest eigenvalue. In the regular case we compute the spectrum of the adjacency matrix of the total graph and the spectra of certain compositions, and we determine some with exactly two main eigenvalues</dc:description><dc:description xml:lang="sl">Združeni graf je zgrajen tako, da se graf združi z njegovim povezavnim grafom s pomočjo incidenc. Podobno konstrukcijo vpeljemo za predznačene grafe. Z dvema podobnima definicijama povezavnega predznačenega grafa definiramo ustrezen združeni predznačeni graf in pokažemo, da se le-ta pri operaciji preklapljanja ohranja. Upoštevamo ravnotežje, frustracijski indeks in frustracijsko število ter največjo lastno vrednost. V regularnem primeru izračunamo spekter matrike sosednosti združenega grafa in spektre določenih sestavov, in prikažemo tiste z natanko dvema glavnima lastnima vrednostima</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-VMNABAYY"><edm:aggregatedCHO rdf:resource="URN:NBN:SI:doc-VMNABAYY" /><edm:isShownBy rdf:resource="http://www.dlib.si/stream/URN:NBN:SI:doc-VMNABAYY/644d29cf-22ce-4e06-8414-91071469aafc/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-VMNABAYY/maxi/edm" /><edm:isShownAt rdf:resource="http://www.dlib.si/details/URN:NBN:SI:doc-VMNABAYY" /></ore:Aggregation></rdf:RDF>