Distance-transitive graphs admit semiregular automorphisms

SLO

First page / Show document

Show document

A- | A+ | Print

Title:	Distance-transitive graphs admit semiregular automorphisms
Authors:	ID Kutnar, Klavdija (Author) ID Šparl, Primož (Author)
Files:	http://dx.doi.org/10.1016/j.ejc.2009.03.018
Language:	English
Work type:	Not categorized
Typology:	1.01 - Original Scientific Article
Organization:	IAM - Andrej Marušič Institute
Abstract:	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.
Keywords:	distance-transitive graph, vertex-transitive graph, semiregular automorphism, permutation group
Year of publishing:	2010
Number of pages:	str. 25-28
Numbering:	Vol. 31, no. 1
PID:	20.500.12556/RUP-3766
ISSN:	0195-6698
UDC:	519.17
COBISS.SI-ID:	1024085332
Publication date in RUP:	15.10.2013
Views:	3878
Downloads:	99
Metadata:
:	Copy citation

Average score:	(0 votes)
Your score:	Voting is allowed only for logged in users.
Share:

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Leave comment

You must log in to leave a comment.

Comments (0)

0 - 0 / 0

There are no comments!

Back