<?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://dirros.openscience.si/IzpisGradiva.php?id=21156"><dc:title>On the diameter of a super-order-commuting graph</dc:title><dc:creator>Bračič,	Janko	(Avtor)
	</dc:creator><dc:creator>Kuzma,	Bojan	(Avtor)
	</dc:creator><dc:subject>symmetric groups</dc:subject><dc:subject>order relation</dc:subject><dc:subject>super graphs</dc:subject><dc:subject>commuting graphs</dc:subject><dc:subject>prime numbers</dc:subject><dc:subject>$d$-complete sequences</dc:subject><dc:description>We answer a question about the diameter of an order-super-commuting graph on a symmetric group by studying the number-theoretical concept of $d$-complete sequences of primes in arithmetic progression.</dc:description><dc:date>2025</dc:date><dc:date>2025-01-08 13:09:14</dc:date><dc:type>Neznano</dc:type><dc:identifier>21156</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>