HomeIssuesMINIMAL EDGE EXTENSIONS OF SOME PRECOMPLETEGRAPHS

MINIMAL EDGE EXTENSIONS OF SOME PRECOMPLETEGRAPHS | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2010. № 1(7).

We consider the minimal edge k-extensions of precomplete graphs - graphs in which there is a vertex adjacent to all other vertices. The lemma about the marginal value of k when a precomplete graph can have a minimal edge k-extension is proved. The full description of all the minimal edge k-extensions of precomplete graphs being joins of a complete graph and an empty graph, a chain or a cycle is given
Download file
Counter downloads: 65
  • Title MINIMAL EDGE EXTENSIONS OF SOME PRECOMPLETEGRAPHS
  • Headline MINIMAL EDGE EXTENSIONS OF SOME PRECOMPLETEGRAPHS
  • Publesher Tomask State UniversityTomsk State University
  • Issue Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics 1(7)
  • Date:
  • DOI
Keywords
предполный граф, минимальное реберное расширение, отказоустойчивая реализация, precomplete graph, minimal edge extension, fault tolerance
Authors
References
Harary F., Hayes J. P. Edge fault tolerance in graphs // Networks. 1993. V. 23. P. 135-142.
Harary F., Hayes J. P. Node fault tolerance in graphs // Networks. 1996. V. 27. P. 19-23.
Богомолов А. М., Салий В. Н. Алгебраические основы теории дискретных систем. М.: Наука, 1997.
Hayes J. P. A graph model for fault-tolerant computing system // IEEE Trans. Comput. 1976. V.C25. No. 9. P. 875-884.
Абросимов М. Б. О вычислительной сложности расширений графов // Прикладная дискретная математика. Приложение. 2009. №1. С. 94-95.
Абросимов М.Б. Минимальные k-расширения предполных графов // Изв. вузов. Математика. 2003. №6(493). С. 3-11.
MINIMAL EDGE EXTENSIONS OF SOME PRECOMPLETEGRAPHS | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2010. № 1(7).
MINIMAL EDGE EXTENSIONS OF SOME PRECOMPLETEGRAPHS | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2010. № 1(7).
Download full-text version
Counter downloads: 180
Download file