Distance-transitive graphs admit semiregular automorphisms

Klavdija Kutnar (Avtor), Primož Šparl (Avtor)

Povzetek

A distance-transitive graph is a graph in which for every two ordered pairs ofvertices ▫$(u,v)$▫ and ▫$(u',v')$▫ such that the distance between ▫$u$▫ and ▫$v$▫ is equal to the distance between ▫$u'$▫ and ▫$v'$▫ there exists an automorphism of the graph mapping ▫$u$▫ to ▫$u'$▫ and ▫$v$▫ to ▫$v'$▫. A semiregular element of a permutation group is anon-identity element having all cycles of equal length in its cycle decomposition. It is shown that every distance-transitive graph admits a semiregular automorphism.

Ključne besede

distance-transitive graph;vertex-transitive graph;semiregular automorphism;permutation group;

Podatki

Jezik:	Angleški jezik
Leto izida:	2010
Tipologija:	1.01 - Izvirni znanstveni članek
Organizacija:	UL FMF - Fakulteta za matematiko in fiziko
UDK:	519.17
COBISS:	1024085332
ISSN:	0195-6698
Št. ogledov:	3220
Št. prenosov:	98
Ocena:	0 (0 glasov)
Metapodatki:

Ostali podatki

Sekundarni jezik:	Angleški jezik
Vrsta dela (COBISS):	Delo ni kategorizirano
Strani:	str. 25-28
Letnik:	ǂVol. ǂ31
Zvezek:	ǂno. ǂ1
Čas izdaje:	2010
DOI:	10.1016/j.ejc.2009.03.018
ID:	1477156