Previous |  Up |  Next

Article

Title: Transmission in graphs: A bound and vertex removing (English)
Author: Šoltés, Ľubomír
Language: English
Journal: Mathematica Slovaca
ISSN: 0139-9918
Volume: 41
Issue: 1
Year: 1991
Pages: 11-16
.
Category: math
.
MSC: 05C12
MSC: 05C99
idZBL: Zbl 0765.05097
idMR: MR1094978
.
Date available: 2009-09-25T10:28:12Z
Last updated: 2012-08-01
Stable URL: http://hdl.handle.net/10338.dmlcz/132387
.
Reference: [1] BEHZAD M., CHARTRAND G., LESNIAK-FOSTER L.: Gгaphs and Digraphs.Weber & Schmidt, Boston 1979.
Reference: [2] ENTRINGER R. C., JACKSON D. E., SNYDER D. A.: Distance in graphs.Czech Math. J., 26 (101), 1976, 283-296. Zbl 0329.05112, MR 0543771
Reference: [3] FAVARON O., KOUIDER M. MAHEO M.: Edge-vulnerability and mean distance.pгepгint.
Reference: [4] HARARY F.: The maximum connectivity of a graph.Proc. Nat. Acad. Sci. U.S., 48, 1962, 1142-1146. Zbl 0115.41003, MR 0137663
Reference: [5] PLESNÍK J.: On the Sum of All Distances in a Graph.J. Graph Theory, 8, 1984, 1-21. Zbl 0552.05048, MR 0732013
.

Files

Files Size Format View
MathSlov_41-1991-1_2.pdf 482.5Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo