Changing and unchanging of the radius of a graph (Q1805308): Difference between revisions

The authors study different classes of extremal graphs with radius \(r\) using non-standard terminologies. In the sense of the book \textit{F. Buckley} and \textit{F. Harary} [Distance in graphs (1990; Zbl 0688.05017)] the authors investigate the following classes of graphs: (a) critical by \(r\), if \(r(G - v) \neq r(G)\) for every vertex \(v\) of \(G\); (b) anticritical by \(r\), if \(r(G - v) = r(G)\) for every vertex \(v\); (c) minimal by \(r\), if \(r(G - e) > r(G)\) for every edge \(e\); (d) antiminimal by \(r\), if \(r(G - e) = r(G)\) for every edge \(e\); (e) maximal by \(r\), if \(r(G + e) < r(G)\) for every edge \(e\); (f) antimaximal by \(r\), if \(r(G + e) = r(G)\) for every edge \(e\). The study of critical, minimal, and maximal graphs by \(r\) was started earlier in 1975, and there are some serious results. Anticritical, antiminimal, and antimaximal graphs by \(r\) are new notions. The paper is useful for further studies of the radius of graphs.