On the graphs with maximum distance or $k$-diameter

Previous | Up | Next

Article

On the graphs with maximum distance or $k$-diameter. (English). Mathematica Slovaca, vol. 55 (2005), issue 2, pp. 131-139

MSC: 05C12, 05C35 | MR 2177703 | Zbl 1110.05029

References:

[1] BUCKLEY F.-HARARY F.: Distance in Graphs. Addison-Wesley, Redwood City, California, 1990. Zbl 0688.05017

[2] CHARTRAND G.-LESNIAK L.: Graphs and Digraphs. (2nd ed.), Wadsworth & Brooks/Cole, Pacific Grove, Boston, 1986. MR 0834583 | Zbl 0666.05001

[3] ENTRINGER R.-JACKSON D.-SNYDER D.: Distance in graphs. Czechoslovak Math. J. 26 (1976), 283-296. MR 0543771 | Zbl 0329.05112

[4] HARARY F.: The maximum connectivity of a graph. Proc. Nat. Acad. Sci. USA 48 (1962), 1142-1146. MR 0137663 | Zbl 0115.41003

[5] ORE O.: Diameters in graphs. J. Combin. Theory 5 (1968), 75-81. MR 0227043 | Zbl 0175.20804

[6] ŠOLTES L.: Transmission in graphs: a bound and vertex removing. Math. Slovaca 41 (1991), 11-16. MR 1094978 | Zbl 0765.05097

[7] SWART C. S.: Distance Measures in Graphs and Subgraphs. M.Sc. Thesis, University of Natal, Durban, 1996.

Partner of