Toll convexity

dc.creatorAlcón, Liliana Graciela
dc.creatorBrešar, Boštjan
dc.creatorGologranc, Tanja
dc.creatorGutiérrez, Marisa
dc.creatorŠumenjak, Tadeja Kraner
dc.creatorPeterin, Iztok
dc.creatorTepeh, Aleksandra
dc.date2015
dc.date2019-11-21T12:48:19Z
dc.date.accessioned2023-07-14T17:32:18Z
dc.date.available2023-07-14T17:32:18Z
dc.identifierhttp://sedici.unlp.edu.ar/handle/10915/85849
dc.identifierissn:0195-6698
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/7427867
dc.descriptionA walk W between two non-adjacent vertices in a graph G is called tolled if the first vertex of W is among vertices from W adjacent only to the second vertex of W, and the last vertex of W is among vertices from W adjacent only to the second-last vertex of W. In the resulting interval convexity, a set S ⊂ V(G) is toll convex if for any two non-adjacent vertices x, y ∈ S any vertex in a tolled walk between x and y is also in S. The main result of the paper is that a graph is a convex geometry (i.e. satisfies the Minkowski-Krein-Milman property stating that any convex subset is the convex hull of its extreme vertices) with respect to toll convexity if and only if it is an interval graph. Furthermore, some well-known types of invariants are studied with respect to toll convexity, and toll convex sets in three standard graph products are completely described.
dc.descriptionFacultad de Ciencias Exactas
dc.formatapplication/pdf
dc.format161-175
dc.languageen
dc.rightshttp://creativecommons.org/licenses/by-nc-sa/4.0/
dc.rightsCreative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
dc.subjectCiencias Exactas
dc.subjectMatemática
dc.subjectGraph in graph theory
dc.subjectVertex of a graph
dc.subjectDetour monophonic
dc.titleToll convexity
dc.typeArticulo
dc.typeArticulo


Este ítem pertenece a la siguiente institución