Primitiveness conditions for systems of two graphs | Applied Discrete Mathematics. Supplement. 2015. № 8.

Primitiveness conditions for systems of two graphs

Some sufficient conditions for primitiveness of two n-vertex digraphs system are obtained in the case when there are no acyclic vertices in one of this two graphs, particularly when it contains a Hamiltonian cycle. Also, an exponent estimate for the two digraphs system is obtained in terms of the exponent of their product. The results can be used for evaluation of the mixing properties of iterative functions based on the transformation branching into two given transformations.

Download file

Counter downloads: 233

Keywords

примитивный граф, экспонент графа, гамильтонов цикл, primitive graph, exponent of graph, Hamiltonian cycle

Authors

Name	Organization	E-mail
Avezova Y. E.	National Research Nuclear University "Moscow Engineering Physics Institute" (Moscow)	avezovayana@gmail.com
Fomichev V. M.	Financial University under the Government of the Russian Federation; LLC "Security Code" (Moscow)	fomichev@nm.ru

Всего: 2

References

Когос К. Г., Фомичев В. М. О разветвлениях криптографических функций на преобразования с заданным признаком // Прикладная дискретная математика. 2012. №1(15). С. 50-54.

Когос К. Г., Фомичев В. М. Положительные свойства неотрицательных матриц // Прикладная дискретная математика. 2012. №4(18). С. 116-121.