Number estimation for additional arcs in a minimal 1-vertex extension of tournament | Applied Discrete Mathematics. Supplement. 2015. № 8.

HomeIssuesNumber estimation for additional arcs in a minimal 1-vertex extension of tournament | Applied Discrete Mathematics. Supplement. 2015. № 8.

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

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.

Download file
Counter downloads: 254

Keywords

турнир, минимальное вершинное расширение, отказоустойчивость, tournament, minimal vertex extension, fault-tolerance

Authors

NameOrganizationE-mail
Abrosimov M. B.Saratov State Universitymic@rambler.ru
Modenova O. V.Saratov State Universityoginiel@rambler.ru
Всего: 2

References

Абросимов М. Б., Долгов А. А. Семейства точных расширений турниров // Прикладная дискретная математика. 2008. №1. С. 101-107.
Абросимов М. Б. Минимальные вершинные расширения направленных звезд // Дискретная математика. 2011. Т. 23. №2. С. 93-102.
Абросимов М. Б. Графовые модели отказоустойчивости. Саратов: Изд-во Сарат. ун-та, 2012. 192 с.
Hayes J. P. A graph model for fault-tolerant computing system // IEEE Trans. Comput. 1976. V.C25. No. 9. P. 875-884.
Number estimation for additional arcs in a minimal 1-vertex extension of tournament | Applied Discrete Mathematics. Supplement. 2015. № 8.

Number estimation for additional arcs in a minimal 1-vertex extension of tournament | Applied Discrete Mathematics. Supplement. 2015. № 8.

Download full-text version
Counter downloads: 1755