Geodesic
Minimal edge extensions of oriented and directed stars
Prikladnaâ diskretnaâ matematika, no. 2 (2011), pp. 77-89.

Voir la notice de l'article provenant de la source Math-Net.Ru

A complete description of all minimal edge $k$-extensions of oriented and directed stars is given.
Keywords: star graph, minimal edge extension, fault tolerance. 
@article{PDM_2011_2_a5,
     author = {M. B. Abrosimov},
     title = {Minimal edge extensions of oriented and directed stars},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {77--89},
     publisher = {mathdoc},
     number = {2},
     year = {2011},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2011_2_a5/}
}
TY  - JOUR
AU  - M. B. Abrosimov
TI  - Minimal edge extensions of oriented and directed stars
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2011
SP  - 77
EP  - 89
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2011_2_a5/
LA  - ru
ID  - PDM_2011_2_a5
ER  - 
%0 Journal Article
%A M. B. Abrosimov
%T Minimal edge extensions of oriented and directed stars
%J Prikladnaâ diskretnaâ matematika
%D 2011
%P 77-89
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2011_2_a5/
%G ru
%F PDM_2011_2_a5
M. B. Abrosimov. Minimal edge extensions of oriented and directed stars. Prikladnaâ diskretnaâ matematika, no. 2 (2011), pp. 77-89. http://geodesic.mathdoc.fr/item/PDM_2011_2_a5/

[1] Bogomolov A. M., Salii V. N., Algebraicheskie osnovy teorii diskretnykh sistem, Nauka, M., 1997 | MR | Zbl

[2] Hayes J. P., “A graph model for fault-tolerant computing system”, IEEE Trans. Comput., C-25:9 (1976), 875–884 | DOI | MR | Zbl

[3] Harary F., Hayes J. P., “Edge fault tolerance in graphs”, Networks, 23 (1993), 135–142 | DOI | MR | Zbl

[4] Harary F., Hayes J. P., “Node fault tolerance in graphs”, Networks, 27 (1996), 19–23 | 3.0.CO;2-H class='badge bg-secondary rounded-pill ref-badge extid-badge'>DOI | MR | Zbl

[5] Kireeva A. V., “Otkazoustoichivost v funktsionalnykh grafakh”, Uporyadochennye mnozhestva i reshetki, 11, Saratov, 1995, 32–38

[6] Sung T. Y., Lin C. Y., Chuang Y. C., Hsu L. H., “Fault tolerant token ring embedding in double loop networks”, Inform. Process. Lett., 66:4 (1998), 201–207 | DOI | MR | Zbl

[7] Abrosimov M. B., “O slozhnosti nekotorykh zadach, svyazannykh s rasshireniyami grafov”, Matem. zametki, 88:5 (2010), 643–650

[8] Abrosimov M. B., “Minimalnye $k$-rasshireniya predpolnykh grafov”, Izv. vuzov. Matematika, 2003, no. 6(493), 3–11 | MR | Zbl

[9] Abrosimov M. B., “Minimalnye rasshireniya neorientirovannykh zvezd”, Teoreticheskie problemy informatiki i ee prilozhenii, 7, SGU, Saratov, 2006, 3–5

[10] Abrosimov M. B., “Minimalnye rasshireniya tranzitivnykh turnirov”, Vestnik Tomskogo gosuniversiteta, 2006, no. 17, Prilozhenie, 187–190