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 111–113
DOI: https://doi.org/10.17223/2226308X/8/42 (Mi pdma196) 		 
Applied Theory of Coding, Automata and Graphs

Number estimation for additional arcs in a minimal $1$-vertex extension of tournament

M. B. Abrosimov, O. V. Modenova

Saratov State University, Saratov
Full-text PDF (498 kB)
References:
PDF
HTML
DOI: https://doi.org/10.17223/2226308X/8/42
Abstract: We obtain lower and upper bounds for the number of additional arcs in minimal vertex $1$-extension of arbitrary tournament. It is shown that the estimates are sharp. We describe tournaments, for which estimates are attained.
Keywords: tournament, minimal vertex extension, fault-tolerance.
Document Type: Article
UDC: 519.17
Language: Russian
Citation: M. B. Abrosimov, O. V. Modenova, “Number estimation for additional arcs in a minimal $1$-vertex extension of tournament”, Prikl. Diskr. Mat. Suppl., 2015, no. 8, 111–113
Citation in format AMSBIB
\Bibitem{AbrMod15}
\by M.~B.~Abrosimov, O.~V.~Modenova
\paper Number estimation for additional arcs in a~minimal $1$-vertex extension of tournament
\jour Prikl. Diskr. Mat. Suppl.
\yr 2015
\issue 8
\pages 111--113
\mathnet{http://mi.mathnet.ru/pdma196}
\crossref{https://doi.org/10.17223/2226308X/8/42}
Linking options:
  • https://www.mathnet.ru/eng/pdma196
  • https://www.mathnet.ru/eng/pdma/y2015/i8/p111
    • 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:169
    Full-text PDF :57
    References:42
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024