English

Mutual-visibility in strong products of graphs via total mutual-visibility

Combinatorics 2024-04-19 v2

Abstract

Let GG be a graph and XV(G)X\subseteq V(G). Then XX is a mutual-visibility set if each pair of vertices from XX is connected by a geodesic with no internal vertex in XX. The mutual-visibility number μ(G)\mu(G) of GG is the cardinality of a largest mutual-visibility set. In this paper, the mutual-visibility number of strong product graphs is investigated. As a tool for this, total mutual-visibility sets are introduced. Along the way, basic properties of such sets are presented. The (total) mutual-visibility number of strong products is bounded from below in two ways, and determined exactly for strong grids of arbitrary dimension. Strong prisms are studied separately and a couple of tight bounds for their mutual-visibility number are given.

Keywords

Cite

@article{arxiv.2210.07835,
  title  = {Mutual-visibility in strong products of graphs via total mutual-visibility},
  author = {Serafino Cicerone and Gabriele Di Stefano and Sandi Klavžar and Ismael G. Yero},
  journal= {arXiv preprint arXiv:2210.07835},
  year   = {2024}
}