A relaxed version of Šoltés's problem and cactus graphs

DOI10.1007/S40840-021-01144-5zbMATH Open1476.05028arXiv1911.10502OpenAlexW3165308402MaRDI QIDQ2239005FDOQ2239005

Jan Bok, Jana Maxová, Nikola Jedličková

Publication date: 2 November 2021

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Abstract: The emph{Wiener index} is one of the most widely studied parameters in chemical graph theory. It is defined as the sum of the lengths of the shortest paths between all unordered pairs of vertices in a given graph. In 1991, v{S}olt'es posed the following problem regarding the Wiener index: Find all graphs such that its Wiener index is preserved upon removal of any vertex. The problem is far from being solved and to this day, only one graph with such property is known: the cycle graph on 11 vertices. In this paper, we solve a relaxed version of the problem, proposed by Knor et al. in 2018. For a given $k$, the problem is to find (infinitely many) graphs having exactly $k$ vertices such that the Wiener index remains the same after removing any of them. We call these vertices emph{good} vertices and we show that there are infinitely many cactus graphs with exactly $k$ cycles of length at least 7 that contain exactly $2k$ good vertices and infinitely many cactus graphs with exactly $k$ cycles of length $cin5,6$ that contain exactly $k$ good vertices. On the other hand, we prove that $G$ has no good vertex if the length of the longest cycle in $G$ is at most $4$.

Full work available at URL: https://arxiv.org/abs/1911.10502

Recommendations

• Wiener index and graphs, almost half of whose vertices satisfy Šoltés property
• Graphs preserving Wiener index upon vertex removal
• Graphs whose Wiener index does not change when a specific vertex is removed
• Graphs preserving total distance upon vertex removal
• Cacti with \(n\)-vertices and \(t\) cycles having extremal Wiener index

zbMATH Keywords

topological indicesWiener indexcactus graphschemical graph theory

Mathematics Subject Classification ID

Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Wiener index of trees: Theory and applications
• Wiener index of generalized 4-stars and of their quadratic line graphs
• Title not available (Why is that?)
• The maximum Wiener polarity index of unicyclic graphs
• Title not available (Why is that?)
• Mathematical aspects of Wiener index
• Title not available (Why is that?)
• Graphs whose Wiener index does not change when a specific vertex is removed
• Graphs preserving Wiener index upon vertex removal

Cited In (4)

• Selected topics on Wiener index
• On the preservation of the Wiener index of cubic graphs upon vertex removal
• Some results on the Wiener index related to the Šoltés problem of graphs
• The Wiener index of signed graphs

This page was built for publication: A relaxed version of Šoltés's problem and cactus graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2239005)