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 geodesic and geodesic interval, namely the set of all vertices lying on geodesics between a pair of vertices in a connected graph, is a part of folklore in metric graph theory. It is also known that Steiner trees of a (multi) set with k (k>2) vertices, generalize geodesics. In Brešar et al. (2009) [1], the authors studied the k-Steiner intervals S(u1,u2,…,uk) on connected graphs (k≥3) as the...
The concept of the k-Steiner interval is a natural generalization of the geodesic (binary) interval. It is defined as a mapping S:V×⋯×V⟶2V such that S(u1,…,uk) consists of all vertices in G that lie on some Steiner tree with respect to a multiset W={u1,…,uk} of vertices from G. In this paper we obtain, for each k, a characterization of the class of graphs in which every k-Steiner interval S has the...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.