<?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-8UMCT4EU/9faf18db-7ef6-412f-b45a-f799ef8bbffe/PDF"><dcterms:extent>417 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-8UMCT4EU/0a9688be-b35c-4a3d-8cec-719a125d28c1/TEXT"><dcterms:extent>34 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-8UMCT4EU"><dcterms:isPartOf rdf:resource="https://www.dlib.si/details/URN:NBN:SI:spr-UP1WMFAR" /><dcterms:issued>2022</dcterms:issued><dc:creator>Abdollahi, Alireza</dc:creator><dc:creator>Zakeri, Niloufar</dc:creator><dc:format xml:lang="sl">številka:1</dc:format><dc:format xml:lang="sl">letnik:22</dc:format><dc:format xml:lang="sl">P1.06 (15 str.)</dc:format><dc:identifier>DOI:10.26493/1855-3974.2332.749</dc:identifier><dc:identifier>COBISSID_HOST:115583747</dc:identifier><dc:identifier>ISSN:1855-3966</dc:identifier><dc:identifier>URN:URN:NBN:SI:doc-8UMCT4EU</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 of a graph</dc:subject><dc:subject xml:lang="en">cospectrality of graphs</dc:subject><dc:subject xml:lang="en">Euclidean norm</dc:subject><dc:subject xml:lang="sl">evklidska norma</dc:subject><dc:subject xml:lang="sl">kospektralnost grafov</dc:subject><dc:subject xml:lang="en">Manhattan norm</dc:subject><dc:subject xml:lang="sl">manhattanska norma</dc:subject><dc:subject xml:lang="sl">matrika sosednosti grafa</dc:subject><dc:subject xml:lang="en">spectra of graphs</dc:subject><dc:subject xml:lang="sl">spektri grafov</dc:subject><dcterms:temporal rdf:resource="2008-2025" /><dc:title xml:lang="sl">Cospectrality of multipartite graphs|</dc:title><dc:description xml:lang="sl">Let ?$G$? be a graph on ?$n$? vertices and consider the adjacency spectrum of ?$G$? as the ordered ?$n$?-tuple whose entries are eigenvalues of ?$G$? written decreasingly. Let ?$G$? and ?$H$? be two non-isomorphic graphs on ?$n$? vertices with spectra ?$S$? and ?$T$?, respectively. Define the distance between the spectra of ?$G$? and ?$H$? as the distance of ?$S$? and ?$T$? to a norm ?$N$? of the ?$n$?-dimensional vector space over real numbers. Define the cospectrality of ?$G$? as the minimum of distances between the spectrum of ?$G$? and spectra of all other non-isomorphic ?$n$? vertices graphs to the norm ?$N$?. In this paper we investigate cospectralities of the cocktail party graph and the complete tripartite graph with parts of the same size to the Euclidean or Manhattan norms</dc:description><dc:description xml:lang="sl">Naj bo ?$G$? graf na ?$n$? vozliščih; obravnavajmo spekter sosednosti grafa ?$G$? kot urejeno ?$n$?-terko, katere elementi so lastne vrednosti grafa ?$G$?, zapisane v padajočem vrstnem redu. Naj bosta ?$G$? in ?$H$? dva neizomorfna grafa na ?$n$? vozliščih s spektroma ?$S$? oz. ?$T$?. Definirajmo razdaljo med spektroma grafov ?$G$? in ?$H$? kot razdaljo spektrov ?$S$? in ?$T$? glede na normo ?$N$? ?$n$?-dimenzionalnega vektorskega prostora nad obsegom realnih števil. Definirajmo kospektralnost grafa ?$G$? kot najmanjšo vrednost razdalj med spektrom grafa ?$G$? in spektri vseh drugih temu grafu neizomorfnih ?$n$? vozliščnih grafov glede na normo ?$N$?. V tem raziskujemo kospektralnost cp-grafa ter polnega tridelnega grafa z deli iste velikosti glede na evklidsko in manhattansko normo</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-8UMCT4EU"><edm:aggregatedCHO rdf:resource="URN:NBN:SI:doc-8UMCT4EU" /><edm:isShownBy rdf:resource="http://www.dlib.si/stream/URN:NBN:SI:doc-8UMCT4EU/9faf18db-7ef6-412f-b45a-f799ef8bbffe/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-8UMCT4EU/maxi/edm" /><edm:isShownAt rdf:resource="http://www.dlib.si/details/URN:NBN:SI:doc-8UMCT4EU" /></ore:Aggregation></rdf:RDF>