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 graphs G = [V(G), E(G)] consider in this article are finite of order |V(G)|= n, undirected, without loops and multiple edges. For any set A ⊂ V(G) denote by 〈A〉 the induced sub graph on A, G - A stands for [V(G)\A]. The words cycle and path mean elementary cycle or path. The vertex connectivity of G will be denoted by k(G), the circumference of G (i.e., the length of a longest cycle in G) by c(G),...