Gliviak, Ferdinand; Knor, Martin; Šoltés, Lubomír On radially maximal graphs. (English) Zbl 0816.05038 Australas. J. Comb. 9, 275-284 (1994). Authors’ abstract: A graph is radially maximal if its radius decreases after the addition of any edge of its complement. It is proved that any graph can be an induced subgraph of a regular radially maximal graph with a prescribed radius \(r\geq 3\). For \(r\geq 4\), \(k\geq 1\), radially maximal graphs with radius \(r\) containing \(k\) cut-nodes are constructed. Reviewer: B.Andrásfai (Budapest) Cited in 1 ReviewCited in 3 Documents MSC: 05C35 Extremal problems in graph theory Keywords:radius; radially maximal graphs PDFBibTeX XMLCite \textit{F. Gliviak} et al., Australas. J. Comb. 9, 275--284 (1994; Zbl 0816.05038)