Previous |  Up |  Next

Article

Title: On the graphs with maximum distance or $k$-diameter (English)
Author: Goddard, Wayne
Author: Swart, Christine S.
Author: Swart, Henda C.
Language: English
Journal: Mathematica Slovaca
ISSN: 0139-9918
Volume: 55
Issue: 2
Year: 2005
Pages: 131-139
.
Category: math
.
MSC: 05C12
MSC: 05C35
idZBL: Zbl 1110.05029
idMR: MR2177703
.
Date available: 2009-09-25T14:24:39Z
Last updated: 2012-08-01
Stable URL: http://hdl.handle.net/10338.dmlcz/128689
.
Reference: [1] BUCKLEY F.-HARARY F.: Distance in Graphs.Addison-Wesley, Redwood City, California, 1990. Zbl 0688.05017
Reference: [2] CHARTRAND G.-LESNIAK L.: Graphs and Digraphs.(2nd ed.), Wadsworth & Brooks/Cole, Pacific Grove, Boston, 1986. Zbl 0666.05001, MR 0834583
Reference: [3] ENTRINGER R.-JACKSON D.-SNYDER D.: Distance in graphs.Czechoslovak Math. J. 26 (1976), 283-296. Zbl 0329.05112, MR 0543771
Reference: [4] HARARY F.: The maximum connectivity of a graph.Proc. Nat. Acad. Sci. USA 48 (1962), 1142-1146. Zbl 0115.41003, MR 0137663
Reference: [5] ORE O.: Diameters in graphs.J. Combin. Theory 5 (1968), 75-81. Zbl 0175.20804, MR 0227043
Reference: [6] ŠOLTES L.: Transmission in graphs: a bound and vertex removing.Math. Slovaca 41 (1991), 11-16. Zbl 0765.05097, MR 1094978
Reference: [7] SWART C. S.: Distance Measures in Graphs and Subgraphs.M.Sc. Thesis, University of Natal, Durban, 1996.
.

Files

Files Size Format View
MathSlov_55-2005-2_1.pdf 481.0Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo