Loading...
Loading...

Go to the content (press return)

Recubrimientos K-arco transitivos de digrafos

Author
Perez, S.
Type of activity
Theses
Other related units
Department of Applied Mathematics and Telematics
Defense's date
2001-02-02
Repository
http://hdl.handle.net/2117/93142 Open in new window
URL
http://hdl.handle.net/2117/93142 Open in new window
Abstract
A digraph or directed graph is said k-arc transitive if it has automorphism group that acts transitively on the set of k-arcs. For a positive integer k, a k-arc of a digraph is a sequence (x0,x1,.,xk) of k+1 vertices of the digraph such that for each i=0,.,k, (xi,xi+1) is an arc of the digraph. Digraphs in this class have high symmetry and so they can be useful as models of transmission and diffusion of the information. One of the problems we work on this Thesis is the modelation of topologies...
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications
GAPCOMB - Geometric, Algebraic and Probabilistic Combinatorics
Citation
Pérez Mansilla, S. "RECUBRIMIENTOS K-ARCO TRANSITIVOS DE DIGRAFOS". Tesi doctoral, UPC, Facultat de Matemàtiques i Estadística, 2001.

Participants

Attachments