Total mutual-visibility in Hamming graphs
Opuscula Mathematica · 2025 · 63-78
DOI: 10.7494/opmath.2025.45.1.63 ↗Kurz gefasst
Fachartikel in der Zeitschrift Opuscula Mathematica, 2025. Verfasst von Csilla Bujtás und 2 weiteren Autor:innen. Die Arbeit wurde bisher 10-mal zitiert (Crossref) und nennt 15 Literaturangaben.
Abstract (Originalsprache)
If \(G\) is a graph and \(X \subseteq V(G)\), then \(X\) is a total mutual-visibility set if every pair of vertices \(x\) and \(y\) of \(G\) admits the shortest \(x,y\)-path \(P\) with \(V(P) \cap X \subseteq \{x,y\}\). The cardinality of the largest total mutual-visibility set of \(G\) is the total mutual-visibility number \(\mu_{\rm t}(G)\) of \(G\). In this paper the total mutual-visibility number is studied on Hamming graphs, that is, Cartesian products of complete graphs. Different equivalent formulations for the problem are derived. The values \(\mu_{\rm t}(K_{n_1}\square K_{n_2}\square K_{n_3})\) are determined. It is proved that \(\mu_{\rm t}(K_{n_1} \square \cdots \square K_{n_r}) = O(N^{r-2})\), where \(N = n_1+\cdots + n_r\), and that \(\mu_{\rm t}(K_s^{\square r}) = \Theta(s^{r-2})\) for every \(r \geq 3\), where \(K_s^{\square r}\) denotes the Cartesian product of \(r\) copies of \(K_s\). The main theorems are also reformulated as Turán-type results on hypergraphs.
Zitieren
APA
Bujtás, C., Klavžar, S., & Tian, J. (2025). Total mutual-visibility in Hamming graphs. Opuscula Mathematica, 63-78. https://doi.org/10.7494/opmath.2025.45.1.63
Vancouver
Bujtás C, Klavžar S, Tian J. Total mutual-visibility in Hamming graphs. Opuscula Mathematica. 2025:63-78. doi:10.7494/opmath.2025.45.1.63
BibTeX
@article{Bujts2025,
author = {Bujtás, Csilla and Klavžar, Sandi and Tian, Jing},
title = {Total mutual-visibility in Hamming graphs},
journal = {Opuscula Mathematica},
year = {2025},
pages = {63--78},
doi = {10.7494/opmath.2025.45.1.63}
}
EUVIMED