Variety of mutual-visibility problems in graphs

Identificadores
URI: http://hdl.handle.net/10498/32540
DOI: 10.1016/J.TCS.2023.114096
ISSN: 0304-3975
Ficheros
Estadísticas
Métricas y Citas
Metadatos
Mostrar el registro completo del ítemFecha
2023Departamento/s
MatemáticasFuente
Theoretical Computer Science, Vol. 974, 2023Resumen
If X is a subset of vertices of a graph G, then vertices u and v are X-visible if there exists a shortest u,v-path P such that V(P)∩X⊆{u,v}. If each two vertices from X are X-visible, then X is a mutual-visibility set. The mutual-visibility number of G is the cardinality of a largest mutual-visibility set of G and has been already investigated. In this paper a variety of mutual-visibility problems is introduced based on which natural pairs of vertices are required to be X-visible. This yields the total, the dual, and the outer mutual-visibility numbers. We first show that these graph invariants are related to each other and to the classical mutual-visibility number, and then we prove that the three newly introduced mutual-visibility problems are computationally difficult. According to this result, we compute or bound their values for several graphs classes that include for instance grid graphs and tori. We conclude the study by presenting some inter-comparison between the values of such parameters, which is based on the computations we made for some specific families.
Materias
Computational complexity; Dual mutual-visibility number; Grid graph; Mutual-visibility; Outer mutual-visibility; Torus graph; Total mutual-visibilityColecciones
- Artículos Científicos [12014]
- Articulos Científicos Matemáticas [517]
- OpenAIRE [58]
Ítems relacionados
Mostrando ítems relacionados por Título, autor o materia.
-
The k-Distance Mutual-Visibility Problem in Graphs
Cera López, Martín; García Vázquez, Pedro; Valenzuela Tripodoro, Juan Carlos
; González Yero, Ismael
(Springer Nature Link, 2025)





