On minimal extensions of special type black-white paths
Prikladnaya Diskretnaya Matematika. Supplement, no. 5 (2012), pp. 88-89
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
The circles and circuits with two vertices of one type and with other vertices of another type are considered. Their minimal vertex and edge extensions are studied. A connection between vertex extensions of some of such circuits and circles are described.
[1] Abrosimov M. B., “Minimalnye $k$-rasshireniya predpolnykh grafov”, Izv. vuzov. Matematika, 2003, no. 6(493), 3–11 | MR | Zbl
[2] Heyes J. P., “A graph model for fault-tolerant computing system”, IEEE Trans. Comput., 25:9 (1976), 875–884 | DOI | MR
[3] Harary F., Hayes J. P., “Edge fault tolerance in graphs”, Networks, 23 (1993), 135–142 | DOI | MR | Zbl