Paperlane

no. 11 · Monday 9 November 2026

Mutual-visibility in (d, 5)-graphs with excess

Tonny K. B

math.CO · 6 pp

Abstract

The author investigates mutual visibility in regular graphs of girth at least 5, with particular emphasis on graphs with excess. A general upper bound on the mutual-visibility number is established in terms of the degree and order. More significantly, an algebraic inequality is derived that restricts the mutual-visibility number of $(d,5,+δ)$-graphs. As applications, the mutual-visibility number of the Robertson graph is shown to be 9, and upper bounds are obtained for the $(5,5)$-cages and the $(6,5)$-cage.

comments
6 pages, 1 figure, i table
fields
Combinatorics
pdf ↗ page arXiv:2611.09513 ↗