Iskanje po repozitoriju

Opis: A graph is said to be k-isoregular if any two vertex subsets of cardinality at most k, that induce subgraphs of the same isomorphism type, have the same number of neighbors. It is shown that no 3-isoregular bicirculant (and more generally, no locally 3-isoregular bicirculant) of order twice an odd number exists. Further, partial results for bicirculants of order twice an even number as well as tricirculants of specific orders, are also obtained. Since 3-isoregular graphs are necessarily strongly regular, a motivation for the above result about bicirculants is that it brings us a step closer to obtaining a direct proof of a classical consequence of the Classification of Finite Simple Groups, that no simply primitive group of degree twice a prime exists for primes greater than 5.
Ključne besede: 3-isoregularity, strongly regular graph, bicirculant, tricirculant
Objavljeno v RUP: 06.08.2025; Ogledov: 776; Prenosov: 6
Celotno besedilo (233,35 KB)