<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://repozitorij.upr.si/IzpisGradiva.php?id=22061"><dc:title>Transitive regular q-analogs of graphs</dc:title><dc:creator>Crnković,	Dean	(Avtor)
	</dc:creator><dc:creator>Mikulić Crnković,	Vedrana	(Avtor)
	</dc:creator><dc:creator>Švob,	Andrea	(Avtor)
	</dc:creator><dc:creator>Zubović Žutolija,	Matea	(Avtor)
	</dc:creator><dc:subject>q-ary design</dc:subject><dc:subject>q-ary graph</dc:subject><dc:subject>regular graph</dc:subject><dc:subject>transitive group</dc:subject><dc:description>In 1976, Delsarte introduced the notion of q-analogs of designs, and q-analogs of graphs were introduced recently by M. Braun et al. In this paper, we extend that study by giving a method for constructing transitive regular q-analogs of graphs. Further, we illustrate the method by giving some examples.  Additionally, we introduced the notion of q-analogs of quasi-strongly regular graphs and give examples of transitive q-analogs of quasi-strongly regular graphs coming from spreads.</dc:description><dc:publisher>Založba Univerze na Primorskem</dc:publisher><dc:date>2025</dc:date><dc:date>2025-11-03 10:27:00</dc:date><dc:type>Članek v reviji</dc:type><dc:identifier>22061</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
