Transmission in graphs: A bound and vertex removing
Mathematica slovaca, Tome 41 (1991) no. 1, pp. 11-16
@article{MASLO_1991_41_1_a1,
author = {\v{S}olt\'es, \v{L}ubom{\'\i}r},
title = {Transmission in graphs: {A} bound and vertex removing},
journal = {Mathematica slovaca},
pages = {11--16},
year = {1991},
volume = {41},
number = {1},
mrnumber = {1094978},
zbl = {0765.05097},
language = {en},
url = {http://geodesic.mathdoc.fr/item/MASLO_1991_41_1_a1/}
}
Šoltés, Ľubomír. Transmission in graphs: A bound and vertex removing. Mathematica slovaca, Tome 41 (1991) no. 1, pp. 11-16. http://geodesic.mathdoc.fr/item/MASLO_1991_41_1_a1/
[1] BEHZAD M., CHARTRAND G., LESNIAK-FOSTER L.: Gгaphs and Digraphs. Weber & Schmidt, Boston 1979.
[2] ENTRINGER R. C., JACKSON D. E., SNYDER D. A.: Distance in graphs. Czech Math. J., 26 (101), 1976, 283-296. | MR | Zbl
[3] FAVARON O., KOUIDER M. MAHEO M.: Edge-vulnerability and mean distance. pгepгint.
[4] HARARY F.: The maximum connectivity of a graph. Proc. Nat. Acad. Sci. U.S., 48, 1962, 1142-1146. | MR | Zbl
[5] PLESNÍK J.: On the Sum of All Distances in a Graph. J. Graph Theory, 8, 1984, 1-21. | MR | Zbl