Previous |  Up |  Next


digraphs; characterization; radius of a digraph; a digraph minimal (critical, maximal) by radius; induced subgraph
We define digraphs minimal, critical, and maximal by three types of radii. Some of these classes are completely characterized, while for the others it is shown that they are large in terms of induced subgraphs.
[1] B. Bollobás: Extremal Graph Theory. Academic Press, London, 1978. MR 0506522
[2] F. Buckley F. Harary: Distance in Graphs. Addison Wesley, Redwood City, CA, 1990. MR 1045632
[3] G. Chartrand L. Lesniak: Graphs and Digraphs. (second edition). Wardsworth and Books/Cole, Monteгey, CA, 1986. MR 0834583
[4] G. Sh. Fridman: On oriented radially critical graphs. Doklady Akad. Nauk SSSR 212 (1973), 565-568. (In Russian.) MR 0412008
[5] F. Gliviak: On radially critical gгaphs. in: Recent Advances in Graph Theory. Proc. Sympos. Prague 1974, Academia, Prague, 1975, pp. 207-221. MR 0384613
[6] F. Gliviak M. Knor Ľ. Šoltés: On radially maximal graphs. Australasian J. Comb. 9 (1994), 275-284. MR 1271207
[7] F. Harary C. Thomassen: Anticritical graphs. Math. Proc. Comb. Phil. Soc. 79 (1976), 11-18. DOI 10.1017/S0305004100052051 | MR 0414439
[8] P. Kyš: On minimal and critical digraphs. In prepaгation.
[9] E. M. Palmer: Graphical Evolution: An Introduction to the Theory of Random Graphs. John Wiley, New York, 1985. MR 0795795 | Zbl 0566.05002
Partner of
EuDML logo