Geodesic
On radially extremal graphs and digraphs, a survey
Mathematica Bohemica, Tome 125 (2000) no. 2, pp. 215-225

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

MR Zbl
The paper gives an overview of results for radially minimal, critical, maximal and stable graphs and digraphs.
The paper gives an overview of results for radially minimal, critical, maximal and stable graphs and digraphs.
DOI : 10.21136/MB.2000.125959
Classification : 05C12, 05C20, 05C35
Keywords: extremal graphs; extremal digraphs; radius; radius of graphs; radius of digraphs 
Gliviak, Ferdinand. On radially extremal graphs and digraphs, a survey. Mathematica Bohemica, Tome 125 (2000) no. 2, pp. 215-225. doi: 10.21136/MB.2000.125959
@article{10_21136_MB_2000_125959,
     author = {Gliviak, Ferdinand},
     title = {On radially extremal graphs and digraphs, a survey},
     journal = {Mathematica Bohemica},
     pages = {215--225},
     year = {2000},
     volume = {125},
     number = {2},
     doi = {10.21136/MB.2000.125959},
     mrnumber = {1768809},
     zbl = {0963.05072},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/MB.2000.125959/}
}
TY  - JOUR
AU  - Gliviak, Ferdinand
TI  - On radially extremal graphs and digraphs, a survey
JO  - Mathematica Bohemica
PY  - 2000
SP  - 215
EP  - 225
VL  - 125
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.21136/MB.2000.125959/
DO  - 10.21136/MB.2000.125959
LA  - en
ID  - 10_21136_MB_2000_125959
ER  - 
%0 Journal Article
%A Gliviak, Ferdinand
%T On radially extremal graphs and digraphs, a survey
%J Mathematica Bohemica
%D 2000
%P 215-225
%V 125
%N 2
%U http://geodesic.mathdoc.fr/articles/10.21136/MB.2000.125959/
%R 10.21136/MB.2000.125959
%G en
%F 10_21136_MB_2000_125959

[1] F. Buckley: Self-centered graphs with a given radius. Proc. 10th S-E Conf. Combinatorics, Graph Theory and Computing. Boca Raton, 1979, pp. 211-215. | MR | Zbl

[2] F. Buckley F. Harary: Distance in Graphs. Addison-Wesley, New York, 1990, 335 pp. | MR

[3] L. Caccetta: On graphs that are critical with respect to the parameters: diameter, connectivity and edge-connectivity. Matematiche (Catania) 47 (1992), 213-229. | MR | Zbl

[4] G. Chartrand, Songlin Tian: Distance in digraphs. Mathematics and Computer Models, Preprint, 1991, 15 pp. | MR

[5] Yu Xiang Du, Lijie Shi, Xiaodong Zhao: The structure of upper radius critical graphs. J. Natur. Sci. Math. 36 (1996), 77-82. | MR

[6] R. D. Dutton S. R. Medidi. R. C. Brigham: Changing and unchanging the radius of a graph. Linear Algebra Appl. 217 (1995), 67-82. | MR

[7] P. Erdős J. Pach R. Pollack Z. Tuza: Radius, diameter, and minimum degree. J. Combin. Theory, Ser. B 47 (1989), 73-79. | DOI | MR

[8] L. Fajtlowicz: A characterisation of radius critical graphs. J. Graph Theory 12 (1988), 529-533. | DOI | MR

[9] G. Sh. Fridman: On radially critical oriented graphs. Dokl. Akad. Nauk 212 (1973), 556-559. (In Russian.) | MR

[10] F. Gliviak: On radially critical graphs. Recent Advances in Graph Theory- Proc. Symp. Prague 1974. Academia, Praha, 1975, pp. 207-221. | MR

[11] F. Gliviak: On the structure of radially critical graphs. Graphs, Hypergraphs and Block Systems. Proc. Symp. Zielona Gora, Poland, 1976, pp. 69-73. | MR | Zbl

[12] F. Gliviak M. Knor L. Šoltés: On radially maximal graphs. Australasian J. Combin. 9 (1994), 275-284. | MR

[13] F. Gliviak M. Knor L. Šoltés: Two-radially maximal graphs with special centers. Math. Slovaca 45 (1995), 227-233. | MR

[14] F. Gliviak M. Knor: On radially extremal digraphs. Math. Bohem. 120 (1995), 41-55. | MR

[15] N. Graham F. Harary: Changing and unchanging the diameter of a hypercube. Discrete Appl. Math. 37/38 (1992), 265-274. | MR

[16] F. Harary: Changing and unchanging invariants for graphs. Bull. Malaysian Math. Soc. (2) 5 (1982), 73-78. | MR | Zbl

[17] F. Harary G. Thomassen: Anticritical graphs. Math. Proc. Cambridge Philos. Soc. 79 (1976), 11-18. | DOI | MR

[18] T. W. Haynes L. M. Lawson R. C. Brigham R. D. Dutton: Changing and unchanging of the graphical invariants: Minimum and maximum degree, maximum clique size, node independence number and edge independence number. Congr. Numer. 72 (1990), 239-252. | MR

[19] J. Harant: An upper bound for the radius of a 3-connected graph. Discrete Math. 122 (1993), 335-341. | DOI | MR | Zbl

[20] J. Harant H. Walther: On the radius of graphs. J. Combin. Theory, Ser. B 30 (1981), 113-117. | DOI | MR

[21] Katsumi Inoue: Radius of 3-connected graphs. SUT J. Math. 32 (1996), 83-90. | MR

[22] Sh. M. Ismailov: The number of arcs of a digraph of a given radius with a given number of vertices and strong components. Dokl. Akad. Nauk Azerbaidzhana 27 (1971), 8-12. (In Russian.) | MR

[23] Ju. Nishanov: On radially critical graphs with maximal diameter. Voprosy algebry, teorii chisel, diferencialnych i integralnych uravneniy. Samarkand State University, Samarkand, 1973, pp. 138-147. (In Russian.)

[24] Ju. Nishanov: On two classes of radially critical graphs. Voprosy algebry i teorii chisel. Samarkand State University, Samarkand, 1980, pp. 16-22. (In Russian.)

[25] Ju. Nishanov: On radially critical graphs with radius two. Modeli i algoritmy prikiadnoj matematiki. Samarkand, 1989. pp. 125-130. (In Russian.)

[26] Ju. Nishanov: On unicyclic radially critical graphs. Voprosy algebry i teorii chisel. Samarkand State University. Samarkand, 1990. pp. 54-65. (In Russian.)

[27] J. Plesnik: Graph Algorithms. Veda, Bratislava. 1983, 343 pp. (in Slovak.)

[28] Tomomi Segawa: Radius increase caused by edge deletion. SUT J. Math. 30 (1994), 159-162. | MR

[29] Songlin Tian: Sum distance in digraphs. Congr. Numer. 78 (1990), 179 -192. | MR

[30] Songlin Tian, Ch. E. Williams: Detour distance in digraphs. Graph Theory and Applications. Proc. Int. Conference, vol. 2, Y. Alavi. A. Schweuk (eds.). John Wiiey and Sons, 1995, pp. 1155-1165. | MR

[31] V. G. Vizing: On the number of edges in a graph with given radius. Dokl. Akad. Nauk 173 (1967). 1245-1246. (In Russian.) | MR

[32] A. A. Zykov: Fundamentals of Graph Theory. Nauka. Moskva, 1987, 381 pp. (In Russian.) | MR

Cité par Sources :