About one heritage character in cyclic semigroups of graphs
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.
Download file
Counter downloads: 201
Keywords
признак, показатель признака, экспонент системы графов, loop-character, index of loop-character, exponent of graph systemAuthors
Name | Organization | |
Avezova Y.E. | National Research Nuclear University (MEPI) | avezovayana@gmail.com |
Fomichev V. M. | National Research Nuclear University (MEPI) | fomichev@nm.ru |
References
Фомичев В. М. Методы дискретной математики в криптологии. М.: Диалог-МИФИ, 2010. 424 c.
Когос К. Г., Фомичев В. М. Положительные свойства неотрицательных матриц // Прикладная дискретная математика. 2012. №4(18). С. 116-121.
Авезова Я. Э., Фомичев В. М. Условия примитивности системы двух графов // Прикладная дискретная математика. Приложение. 2015. №8. С. 113-114.

About one heritage character in cyclic semigroups of graphs | Applied Discrete Mathematics. Supplement. 2016. № 9.
Download full-text version
Counter downloads: 1385