<?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-JRSOCSJJ/9E177475-721F-4215-BE4E-1C1B927728E6/PDF"><dcterms:extent>0 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-JRSOCSJJ/0afa9fc9-0bc6-4c9b-ad05-9fea9c4b0a74/PDF"><dcterms:extent>361 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-JRSOCSJJ/08a38fe5-5ddf-49af-ba70-d012b10cb1ab/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-JRSOCSJJ"><dcterms:isPartOf rdf:resource="https://www.dlib.si/details/URN:NBN:SI:spr-UP1WMFAR" /><dcterms:issued>2013</dcterms:issued><dc:creator>Kalmanovich, Daniel</dc:creator><dc:format xml:lang="sl">številka:1</dc:format><dc:format xml:lang="sl">letnik:6</dc:format><dc:format xml:lang="sl">str. 99-115</dc:format><dc:identifier>COBISSID:16470617</dc:identifier><dc:identifier>ISSN:1855-3966</dc:identifier><dc:identifier>URN:URN:NBN:SI:doc-JRSOCSJJ</dc:identifier><dc:language>en</dc:language><dc:publisher xml:lang="sl">Društvo matematikov, fizikov in astronomov Slovenije</dc:publisher><dcterms:isPartOf xml:lang="sl">Ars mathematica contemporanea</dcterms:isPartOf><dc:subject xml:lang="en">antipodal graph</dc:subject><dc:subject xml:lang="en">association scheme</dc:subject><dc:subject xml:lang="en">distance regular graph of diameter 3</dc:subject><dc:subject xml:lang="en">Godsil-Hensel matrix</dc:subject><dc:subject xml:lang="en">group ring</dc:subject><dc:subject xml:lang="en">Taylor graph</dc:subject><dc:subject xml:lang="en">two-graph</dc:subject><dcterms:temporal rdf:resource="2008-2025" /><dc:title xml:lang="sl">On D. G. Higman's note on regular 3-graphs|</dc:title><dc:description xml:lang="sl">We introduce the notion of a ?$t$?-graph and prove that regular 3-graphs are equivalent to cyclic antipodal 3-fold covers of a complete graph. This generalizes the equivalence of regular two-graphs and Taylor graphs. As a consequence, an equivalence between cyclic antipodal distance regular graphs of diameter 3 and certain rank 6 commutative association schemes is proved. New examples of regular 3-graphs are presented</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-JRSOCSJJ"><edm:aggregatedCHO rdf:resource="URN:NBN:SI:doc-JRSOCSJJ" /><edm:isShownBy rdf:resource="http://www.dlib.si/stream/URN:NBN:SI:doc-JRSOCSJJ/9E177475-721F-4215-BE4E-1C1B927728E6/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-JRSOCSJJ/maxi/edm" /><edm:isShownAt rdf:resource="http://www.dlib.si/details/URN:NBN:SI:doc-JRSOCSJJ" /></ore:Aggregation></rdf:RDF>