Geodesic
Some questions on minimal extensions of graphs
Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, Tome 6 (2006) no. 1, pp. 86-91.

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

Some statements concerning minimal extensions of graphs are presented that seem to be quite evident at first sight but are not so simple under closer inspection. 
@article{ISU_2006_6_1_a9,
     author = {M. B. Abrosimov},
     title = {Some questions on minimal extensions of graphs},
     journal = {Izvestiya of Saratov University. Mathematics. Mechanics. Informatics},
     pages = {86--91},
     publisher = {mathdoc},
     volume = {6},
     number = {1},
     year = {2006},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ISU_2006_6_1_a9/}
}
TY  - JOUR
AU  - M. B. Abrosimov
TI  - Some questions on minimal extensions of graphs
JO  - Izvestiya of Saratov University. Mathematics. Mechanics. Informatics
PY  - 2006
SP  - 86
EP  - 91
VL  - 6
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ISU_2006_6_1_a9/
LA  - ru
ID  - ISU_2006_6_1_a9
ER  - 
%0 Journal Article
%A M. B. Abrosimov
%T Some questions on minimal extensions of graphs
%J Izvestiya of Saratov University. Mathematics. Mechanics. Informatics
%D 2006
%P 86-91
%V 6
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ISU_2006_6_1_a9/
%G ru
%F ISU_2006_6_1_a9
M. B. Abrosimov. Some questions on minimal extensions of graphs. Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, Tome 6 (2006) no. 1, pp. 86-91. http://geodesic.mathdoc.fr/item/ISU_2006_6_1_a9/

[1] Abrosimov M. B., “O neizomorfnykh optimalnykh 1-otkazoustoichivykh realizatsiyakh nekotorykh grafov”, Teoreticheskie problemy informatiki i ee prilozhenii, 3, Izd-vo Sarat. un-ta, Saratov, 2000, 3–10

[2] Abrosimov M. B., “Minimalnye rasshireniya ob'edinenii nekotorykh grafov”, Teoreticheskie problemy informatiki i ee prilozhenii, 4, Izd-vo Sarat. un-ta, Saratov, 2001, 3–11

[3] Abrosimov M. B., “Minimalnye rasshireniya dopolnenii grafov”, Teoreticheskie problemy informatiki i ee prilozhenii, 4, Izd-vo Sarat. un-ta, Saratov, 2001, 11–19

[4] Abrosimov M. B., “O minimalnykh rasshireniyakh grafov, soderzhaschikh izolirovannye vershiny”, Vestnik TGU. Prilozhenie. Tomsk, 2002, no. 1(II), 24–29

[5] Abrosimov M. B., “Minimalnye $k$-rasshireniya predpolnykh grafov”, Izvestiya vuzov: Matematika, 2003, no. 6(493), 3–11

[6] Abrosimov M. B., “O neizomorfnykh minimalnykh rebernykh 1-rasshireniyakh nekotorykh grafov”, Teoreticheskie zadachi informatiki i ee prilozhenii, Izd-vo Sarat. un-ta, Saratov, 2004 (to appear)

[7] Bogomolov A. M., Salii V. N., Algebraicheskie osnovy teorii diskretnykh sistem, Nauka, M., 1997

[8] Kharari F., Teoriya grafov, Editorial URSS, M., 2003

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

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

[11] Skiena S., Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica, Addison-Wesley, Reading, MA, 1990 | MR | Zbl