You are viewing a javascript disabled version of the site. Please enable Javascript for this site to function properly.
Go to headerGo to navigationGo to searchGo to contentsGo to footer
In content section. Select this link to jump to navigation

An Algorithmic-type Classification of Tetravalent One-regular Graphs Using Computer Algebra Tools

Article type: Research Article

Authors: Ghasemi, Mohsen

Affiliations: Department of Mathematics, Urmia University, Urmia 57135, Iran. m.ghasemi@urmia.ac.ir

Note: [] Address for correspondence: Department of Mathematics, Urmia University, Urmia 57135, Iran

Abstract: A finite graph is one-regular if its automorphism group acts regularly on the set of its arcs. In the present paper, tetravalent one-regular graphs of order 7p2, where p is a prime, are classified using computer algebra tools.

Keywords: s-transitive graphs, symmetric graphs, Cayley graphs, magma, combinatorial algorithms

DOI: 10.3233/FI-2014-1119

Journal: Fundamenta Informaticae, vol. 135, no. 3, pp. 211-228, 2014

Received June 2013
|
Revision received November 2013
|
Published: 2014
Price: EUR 27.50
Show more