Soltés problem for the Kirchhoff index of a graph
Abstract
We say that v∈ V(G) is a \textit{good vertex} if the Kirchhoff index remains unchanged when v is removed, i.e. Kf(G)=Kf(G−v). In 1991, Šoltés studied the Wiener index of a graph and posed the problem of identifying graphs for which the removal of an arbitrary vertex preserves the Wiener index. In this paper, we explore a similar concept: identifying \textit{Kirchhoff Šoltés graphs}, i.e. graphs in which all vertices are good vertices. We show that the cycle C5 is a Kirchhoff Šoltés graph. We consider several relaxed versions of the Kirchhoff Šoltés problem, where the primary objective is to identify graphs containing at least one good vertex. One of them is the \textit{β-Kirchhoff Šoltés problem}, which seeks to find an infinite family of graphs in which the proportion of good vertices is at least β, with β∈ (0,1] being a specified rational number. Another one involves constructing infinite families of graphs where the proportion of good vertices increases and asymptotically approaches a given real number γ∈ (0,1] as the order of the graph grows. We demonstrate that both relaxed versions have infinitely many solutions. In particular, we prove the existence of infinitely many graphs for which the proportion β of good vertices, 1/7≤ β<1/5 tends to a certain irrational number. Furthermore, we prove the existence of infinitely many graphs with half good vertices, and for each s∈ℕ, we construct an infinite family of graphs whose proportion of good vertices tends to (s+1)/(2s+1). These findings could be pivotal in addressing the original problem of determining whether there are additional solutions beyond C5.
Versions
Related
- Budget-Constrained Graph Augmentation for Robust Network Design via Kirchhoff Index Minimization
- Strong Lefschetz property of the Kirchhoff algebra of the complete tripartite graph K1,1,n
- A Decomposition of the Hitting Time Index Using the Kirchhoff Index and an Asymmetry Term
- An infinite family of graphs with Šoltés fraction uniformly above one half
- The p-local topologoical period-index problem in dimensions 2p+2 and below
BibTeX
@misc{gottwald2026soltés,
title = {{Soltés problem for the Kirchhoff index of a graph}},
author = {Kurt Klement Gottwald and Tomislav Došlić and Snježana Majstorović Ergotić},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.13751},
eprint = {2609.13751},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.13751},
note = {CC BY-NC-ND 4.0},
}
RIS
TY - UNPB
TI - Soltés problem for the Kirchhoff index of a graph
AU - Kurt Klement Gottwald
AU - Tomislav Došlić
AU - Snježana Majstorović Ergotić
PY - 2026
DA - 2026/09/12
PB - arXiv
DO - 10.48550/arxiv.2609.13751
UR - https://arxiv.org/abs/2609.13751
AB - We say that v∈ V(G) is a \textit{good vertex} if the Kirchhoff index remains unchanged when v is removed, i.e. Kf(G)=Kf(G−v). In 1991, Šoltés studied the Wiener index of a graph and posed the problem of identifying graphs for which the removal of an arbitrary vertex preserves the Wiener index. In this paper, we explore a similar concept: identifying \textit{Kirchhoff Šoltés graphs}, i.e. graphs in which all vertices are good vertices. We show that the cycle C_5 is a Kirchhoff Šoltés graph. We consider several relaxed versions of the Kirchhoff Šoltés problem, where the primary objective is to identify graphs containing at least one good vertex. One of them is the \textit{β-Kirchhoff Šoltés problem}, which seeks to find an infinite family of graphs in which the proportion of good vertices is at least β, with β∈ (0,1] being a specified rational number. Another one involves constructing infinite families of graphs where the proportion of good vertices increases and asymptotically approaches a given real number γ∈ (0,1] as the order of the graph grows. We demonstrate that both relaxed versions have infinitely many solutions. In particular, we prove the existence of infinitely many graphs for which the proportion β of good vertices, 1/7≤ β<1/5 tends to a certain irrational number. Furthermore, we prove the existence of infinitely many graphs with half good vertices, and for each s∈ℕ, we construct an infinite family of graphs whose proportion of good vertices tends to (s+1)/(2s+1). These findings could be pivotal in addressing the original problem of determining whether there are additional solutions beyond C_5.
ER -