Geodesic
Domination of cyclic monotone $(s,t)$-graphs
Matematičeskie zametki, Tome 67 (2000) no. 2, pp. 288-294.

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

@article{MZM_2000_67_2_a12,
     author = {A. A. Chernyak},
     title = {Domination of cyclic monotone $(s,t)$-graphs},
     journal = {Matemati\v{c}eskie zametki},
     pages = {288--294},
     publisher = {mathdoc},
     volume = {67},
     number = {2},
     year = {2000},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MZM_2000_67_2_a12/}
}
TY  - JOUR
AU  - A. A. Chernyak
TI  - Domination of cyclic monotone $(s,t)$-graphs
JO  - Matematičeskie zametki
PY  - 2000
SP  - 288
EP  - 294
VL  - 67
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MZM_2000_67_2_a12/
LA  - ru
ID  - MZM_2000_67_2_a12
ER  - 
%0 Journal Article
%A A. A. Chernyak
%T Domination of cyclic monotone $(s,t)$-graphs
%J Matematičeskie zametki
%D 2000
%P 288-294
%V 67
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MZM_2000_67_2_a12/
%G ru
%F MZM_2000_67_2_a12
A. A. Chernyak. Domination of cyclic monotone $(s,t)$-graphs. Matematičeskie zametki, Tome 67 (2000) no. 2, pp. 288-294. http://geodesic.mathdoc.fr/item/MZM_2000_67_2_a12/

[1] Satyanarayana A., Prabhakar A., “New topological formula and rapid algorithm for reliability analysis of complex networks”, IEEE Trans. Reliability, 27 (1978), 82–100 | MR | Zbl

[2] Huseby A. B., “Domination theory and Crapo $b$-invariant”, Networks, 19 (1989), 135–149 | DOI | MR | Zbl

[3] Satyanarayana A., Chang M. K., “Network reliability and the factoring theorem”, Networks, 13 (1983), 107–120 | DOI | MR | Zbl

[4] Huseby A. B., A unified theory of domination and signed domination with application to exact reliability computations, Tech. Rep. 3, Institute of Math., Oslo, 1983

[5] Hagstorm J. N., “Directed network reliability: domination and computing coefficients of the success-marginal expansion”, Networks, 20 (1990), 65–78 | DOI | MR

[6] Barlow R. E., Iyer S., “Computational complexity of coherent systems and the reliability polynomial”, Probab. Engrg. Inform. Sci., 2 (1988), 461–469

[7] Kahn J., Sturtevant D., Möbius inversion and directed network reliability, Tech. Rep., Rutgers Univ., New Brunswick, 1983

[8] Rodriguez J., Traldi L., “$(K,j)$-domination and $(K,j)$-reliability”, Networks, 30 (1997), 293–306 | 3.0.CO;2-E class='badge bg-secondary rounded-pill ref-badge extid-badge'>DOI | MR | Zbl

[9] Chernyak A. A., “A new graph-combinatorial method for reliability analysis of monotone graphs”, Proc. 8th Internat. Sympos. Reliability, V. 1, Budapest, 1991, 135–140

[10] Satyanarayana A., “A unified formula for analysis of some network reliability problems”, IEEE Trans. Reliability, 31 (1982), 23–32 | Zbl

[11] Satyanarayana A., Hagstorm J. N., “A new algorithm for the reliability analysis of multi-terminal networks”, IEEE Trans. Reliability, 30 (1981), 325–334 | Zbl

[12] Baikhelt F., Franken P., Nadezhnost: matematicheskii podkhod, Radio i svyaz, M., 1988

[13] Chernyak A. A., “Atsiklicheskie monotonnye grafy: dominirovanie i nadezhnost”, Vestsi NAN Belarusi. Ser. fiz.-tekhn. navuk, 1998, no. 3, 108–114

[14] Chernyak A. A., Chernyak Zh. A., “A unified domination approach for reliability analysis for networks with arbitrary logic in vertices”, IEEE Trans. Reliability, 45 (1996), 114–119 | DOI

[15] Chernyak A. A., “Kombinatorno-grafovyi metod analiza nadezhnosti slozhnykh sistem s monotonnymi bulevymi funktsiyami”, Avtomatika i telemekhanika, 1991, no. 4, 165–174 | MR | Zbl

[16] Ball V. O., Provan J. S., “Calculating bounds on reachability and connectedness in stochastic networks”, Networks, 13 (1981), 253–278 | DOI

[17] Willie R. R., “A theorem concerning cyclic directed graphs with application to network reliability”, Networks, 10 (1980), 71–78 | DOI | MR | Zbl

[18] Valiant L. G., “The complexity of enumeration and reliability problems”, SIAM J. Comput., 8 (1979), 410–421 | DOI | MR | Zbl

[19] Geri M., Dzhonson D., Vychislitelnye mashiny i trudnorazreshimye zadachi, Mir, M., 1982

[20] Chernyak A. A., Chernyak Zh. A., “Note on complexity of computing the domination of binary systems”, Discrete Appl. Math., 73 (1997), 289–295 | DOI | MR | Zbl