×

On radially maximal graphs. (English) Zbl 0816.05038

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.

MSC:

05C35 Extremal problems in graph theory
PDFBibTeX XMLCite