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

On the upper bound for the number of additional edges in minimal vertex extensions of colored circles | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2013. № 6 (Приложение).

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: 183
  • Title On the upper bound for the number of additional edges in minimal vertex extensions of colored circles
  • Headline On the upper bound for the number of additional edges in minimal vertex extensions of colored circles
  • Publesher Tomask State UniversityTomsk State University
  • Issue Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics 6 (Приложение)
  • Date:
  • DOI
Keywords
граф, цикл, минимальное расширение, отказоустойчивость, graph, circle, minimal extension, fault-tolerance
Authors
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 | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2013. № 6 (Приложение).
On the upper bound for the number of additional edges in minimal vertex extensions of colored circles | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2013. № 6 (Приложение).
Download full-text version
Counter downloads: 1887
Download file