About one heritage character in cyclic semigroups of graphs
Prikladnaya Diskretnaya Matematika. Supplement, no. 9 (2016), pp. 105-109
Cet article a éte moissonné depuis la source Math-Net.Ru
This paper is devoted to describing the character of loop existing at the given vertex subset in a cyclic semigroup of digraphs named as loop-character. Some attained bounds and formulae for the loop-character index are obtained. They are expressed in terms of circuit lengths in a digraph, which is the generator of the cyclic semigroup. An example showing the exactness of the bounds is given. The results can be used for estimating exponents of wide range primitive digraph systems.
Keywords:
loop-character, index of loop-character, exponent of graph system.
@article{PDMA_2016_9_a40,
author = {Y. E. Avezova and V. M. Fomichev},
title = {About one heritage character in cyclic semigroups of graphs},
journal = {Prikladnaya Diskretnaya Matematika. Supplement},
pages = {105--109},
year = {2016},
number = {9},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/PDMA_2016_9_a40/}
}
Y. E. Avezova; V. M. Fomichev. About one heritage character in cyclic semigroups of graphs. Prikladnaya Diskretnaya Matematika. Supplement, no. 9 (2016), pp. 105-109. http://geodesic.mathdoc.fr/item/PDMA_2016_9_a40/
[1] Fomichev V. M., Metody diskretnoi matematiki v kriptologii, Dialog-MIFI, M., 2010, 424 pp.
[2] Kogos K. G., Fomichev V. M., “Polozhitelnye svoistva neotritsatelnykh matrits”, Prikladnaya diskretnaya matematika, 2012, no. 4(18), 5–13
[3] Avezova Ya. E., Fomichev V. M., “Usloviya primitivnosti sistemy dvukh grafov”, Prikladnaya diskretnaya matematika. Prilozhenie, 2015, no. 8, 113–114