On regular graphs with \v{S}olt\'es vertices
From MaRDI portal
Publication:6430372
Abstract: Let be the Wiener index of a graph . We say that a vertex is a v{S}olt'es vertex in if , i.e. the Wiener index does not change if the vertex is removed. In 1991, v{S}olt'es posed the problem of identifying all connected graphs with the property that all vertices of are v{S}olt'es vertices. The only such graph known to this day is . As the original problem appears to be too challenging, several relaxations were studied: one may look for graphs with at least v{S}oltes vertices; or one may look for -v{S}olt'es graphs, i.e. graphs where the ratio between the number of v{S}olt'es vertices and the order of the graph is at least . Note that the original problem is, in fact, to find all -v{S}olt'es graphs. We intuitively believe that every -v{S}olt'es graph has to be regular and has to possess a high degree of symmetry. Therefore, we are interested in regular graphs that contain one or more v{S}olt'es vertices. In this paper, we present several partial results. We describe a construction that gives rise to an infinite family of cubic -connected graphs with two v{S}olt'es vertices. Moreover, we report that a computer search on publicly available collections of vertex-transitive graphs did not reveal any -v{S}olt'es graph. We are only able to provide examples of large -v{S}olt'es graphs that are obtained by truncating certain cubic vertex-transitive graphs. This leads us to believe that no -v{S}olt'es graph other than exists.
This page was built for publication: On regular graphs with \v{S}olt\'es vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6430372)