The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The objective of the present paper is to study the maximum radius of a connected graph of order , minimum degree and girth at least . Erdős, Pach, Pollack and Tuza proved that if , that is, the graph is triangle‐free, then , and noted that up to the value of the additive constant, this upper bound is tight. In this paper we shall determine the exact maximum...