Prikladnaya Diskretnaya Matematika. Supplement
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Prikl. Diskr. Mat. Suppl.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Prikladnaya Diskretnaya Matematika. Supplement, 2015, Issue 8, Pages 113–114
DOI: https://doi.org/10.17223/2226308X/8/43 (Mi pdma202) 		 
This article is cited in 2 scientific papers (total in 2 papers)

Applied Theory of Coding, Automata and Graphs

Primitiveness conditions for systems of two graphs

Y. E. Avezovaa, V. M. Fomichevbc

a National Engineering Physics Institute "MEPhI", Moscow
b Financial University under the Government of the Russian Federation, Moscow
c "Security Code", Moscow
Full-text PDF (544 kB) Citations (2)
References:
PDF
HTML
DOI: https://doi.org/10.17223/2226308X/8/43
Abstract: 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.
Keywords: primitive graph, exponent of graph, Hamiltonian cycle.
Document Type: Article
UDC: 519.6
Language: Russian
Citation: Y. E. Avezova, V. M. Fomichev, “Primitiveness conditions for systems of two graphs”, Prikl. Diskr. Mat. Suppl., 2015, no. 8, 113–114
Citation in format AMSBIB
\Bibitem{AveFom15}
\by Y.~E.~Avezova, V.~M.~Fomichev
\paper Primitiveness conditions for systems of two graphs
\jour Prikl. Diskr. Mat. Suppl.
\yr 2015
\issue 8
\pages 113--114
\mathnet{http://mi.mathnet.ru/pdma202}
\crossref{https://doi.org/10.17223/2226308X/8/43}
Linking options:
  • https://www.mathnet.ru/eng/pdma202
  • https://www.mathnet.ru/eng/pdma/y2015/i8/p113
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Prikladnaya Diskretnaya Matematika. Supplement
    Statistics & downloads:
    Abstract page:163
    Full-text PDF :59
    References:33
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024