On the upper bound for the number of additional edges in minimal vertex extensions of colored circles | Applied Discrete Mathematics. Supplement. 2013. № 6.

HomeIssuesOn the upper bound for the number of additional edges in minimal vertex extensions of colored circles | Applied Discrete Mathematics. Supplement. 2013. № 6.

On the upper bound for the number of additional edges in minimal vertex extensions of colored circles

An upper bound for the number of additional edges in the minimum vertex 1-extensions of cycles with the vertices of two types and a general construction of one of such extensions are given.

Download file
Counter downloads: 282

Keywords

граф, цикл, минимальное расширение, отказоустойчивость, graph, circle, minimal extension, fault-tolerance

Authors

NameOrganizationE-mail
Bondarenko P. P.Saratov State Universitypolinabond@gmail.com
Всего: 1

References

Hayes J. P. A graph model for fault-tolerant computing system // IEEE Trans. Comput. 1976. V.C-25. No. 9. P. 875-884.
Абросимов М. Б. Графовые модели отказоустойчивости. Саратов : Изд-во Сарат. ун-та, 2012.
On the upper bound for the number of additional edges in minimal vertex extensions of colored circles | Applied Discrete Mathematics. Supplement. 2013. № 6.

On the upper bound for the number of additional edges in minimal vertex extensions of colored circles | Applied Discrete Mathematics. Supplement. 2013. № 6.