An infinite family of graphs with Šoltés fraction uniformly above one half
A. A. Dobrynin
Abstract
The Wiener index W(G) of a connected graph G is the sum of the distances between all unordered pairs of vertices. A vertex x is a Šoltés vertex if G-x is connected and W(G-x)=W(G). We construct an infinite family of graphs in which the proportion of Šoltés vertices is strictly greater than (21-3)/3=0.5275…>1/2 and decreases to this value from 2/3. The family is also described by a generalized Pell equation and starts from a 12-vertex example of Akhmejanova et al. (Discrete Appl. Math. 325 (2023) 37-42). We also show that the construction remains valid after adding edges among certain vertices.
Create a lesson
Related papers
Fractional colorings of Kr-free graphs with local demands
Ewan Davies, Abhishek Dhawan, Abhishek Methuku et al.
Short permutation pattern waves: The complete length-five classification
Lihong Qiu, Minglei Mao, Yaping Mao
Automatic partition identities
Laurent Bartholdi
Well-Covered Powers: Cartesian Products and Cayley Graphs
Haobo Ma, Thanh Vu, Wenlin Zhang
Lemmas and Conjectures in Spectral Graph Theory
Tristan Cazenave
On the lower- and upper bounds of three-colored anti-Ramsey numbers
Máté Giesz