Geodesic
Algorithm for constructing T-irreducible extension of polygonal digraphs
Prikladnaya Diskretnaya Matematika. Supplement, no. 7 (2014), pp. 124-126

Voir la notice de l'article provenant de la source Math-Net.Ru

Directed graphs are mathematical models of discrete systems. T-irreducible extensions are widely used in cryptography and diagnosis of discrete systems. A polygonal graph is a digraph obtained from a circuit by some orientation of its edges. An algorithm is proposed to construct a T-irreducible extension for a polygonal graph. Correctness of the algorithm is proved.
Keywords: polygonal graph, fault tolerance, T-irreducible extension. 
@article{PDMA_2014_7_a52,
     author = {A. V. Gavrikov},
     title = {Algorithm for constructing {T-irreducible} extension of polygonal digraphs},
     journal = {Prikladnaya Diskretnaya Matematika. Supplement},
     pages = {124--126},
     publisher = {mathdoc},
     number = {7},
     year = {2014},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDMA_2014_7_a52/}
}
TY  - JOUR
AU  - A. V. Gavrikov
TI  - Algorithm for constructing T-irreducible extension of polygonal digraphs
JO  - Prikladnaya Diskretnaya Matematika. Supplement
PY  - 2014
SP  - 124
EP  - 126
IS  - 7
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDMA_2014_7_a52/
LA  - ru
ID  - PDMA_2014_7_a52
ER  - 
%0 Journal Article
%A A. V. Gavrikov
%T Algorithm for constructing T-irreducible extension of polygonal digraphs
%J Prikladnaya Diskretnaya Matematika. Supplement
%D 2014
%P 124-126
%N 7
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDMA_2014_7_a52/
%G ru
%F PDMA_2014_7_a52
A. V. Gavrikov. Algorithm for constructing T-irreducible extension of polygonal digraphs. Prikladnaya Diskretnaya Matematika. Supplement, no. 7 (2014), pp. 124-126. http://geodesic.mathdoc.fr/item/PDMA_2014_7_a52/