Geodesic
On the graphs with maximum distance or $k$-diameter
Mathematica slovaca, Tome 55 (2005) no. 2, pp. 131-139
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 05C12, 05C35 
@article{MASLO_2005_55_2_a0,
     author = {Goddard, Wayne and Swart, Christine S. and Swart, Henda C.},
     title = {On the graphs with maximum distance or $k$-diameter},
     journal = {Mathematica slovaca},
     pages = {131--139},
     year = {2005},
     volume = {55},
     number = {2},
     mrnumber = {2177703},
     zbl = {1110.05029},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/MASLO_2005_55_2_a0/}
}
TY  - JOUR
AU  - Goddard, Wayne
AU  - Swart, Christine S.
AU  - Swart, Henda C.
TI  - On the graphs with maximum distance or $k$-diameter
JO  - Mathematica slovaca
PY  - 2005
SP  - 131
EP  - 139
VL  - 55
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/MASLO_2005_55_2_a0/
LA  - en
ID  - MASLO_2005_55_2_a0
ER  - 
%0 Journal Article
%A Goddard, Wayne
%A Swart, Christine S.
%A Swart, Henda C.
%T On the graphs with maximum distance or $k$-diameter
%J Mathematica slovaca
%D 2005
%P 131-139
%V 55
%N 2
%U http://geodesic.mathdoc.fr/item/MASLO_2005_55_2_a0/
%G en
%F MASLO_2005_55_2_a0
Goddard, Wayne; Swart, Christine S.; Swart, Henda C. On the graphs with maximum distance or $k$-diameter. Mathematica slovaca, Tome 55 (2005) no. 2, pp. 131-139. http://geodesic.mathdoc.fr/item/MASLO_2005_55_2_a0/

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

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

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

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

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

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

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