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, 2016, Issue 9, Pages 105–109
DOI: https://doi.org/10.17223/2226308X/9/41 (Mi pdma260) 		 
This article is cited in 2 scientific papers (total in 2 papers)

Applied Theory of Automata and Graphs

About one heritage character in cyclic semigroups of graphs

Y. E. Avezovaa, V. M. Fomichevbacd

a National Engineering Physics Institute "MEPhI", Moscow
b Financial University under the Government of the Russian Federation, Moscow
c Federal Research Center "Computer Science and Control" of Russian Academy of Sciences, Moscow
d "Security Code", Moscow
Full-text PDF (581 kB) Citations (2)
References:
PDF
HTML
DOI: https://doi.org/10.17223/2226308X/9/41
Abstract: 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.
Document Type: Article
UDC: 519.1
Language: Russian
Citation: Y. E. Avezova, V. M. Fomichev, “About one heritage character in cyclic semigroups of graphs”, Prikl. Diskr. Mat. Suppl., 2016, no. 9, 105–109
Citation in format AMSBIB
\Bibitem{AveFom16}
\by Y.~E.~Avezova, V.~M.~Fomichev
\paper About one heritage character in cyclic semigroups of graphs
\jour Prikl. Diskr. Mat. Suppl.
\yr 2016
\issue 9
\pages 105--109
\mathnet{http://mi.mathnet.ru/pdma260}
\crossref{https://doi.org/10.17223/2226308X/9/41}
Linking options:
  • https://www.mathnet.ru/eng/pdma260
  • https://www.mathnet.ru/eng/pdma/y2016/i9/p105
    • 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:153
    Full-text PDF :50
    References:25
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024