Mutual d-visibility in Graphs

Identificadores
URI: http://hdl.handle.net/10498/38731
DOI: 10.1007/S00025-025-02450-1
ISSN: 1420-9012
ISSN: 1422-6383
Ficheros
Estadísticas
Métricas y Citas
Metadatos
Mostrar el registro completo del ítemFecha
2025Departamento/s
Estadística e Investigación OperativaFuente
Results in Mathematics - 2025, Vol. 80 n. 5, artículo n. 130Resumen
Let d be a positive integer. The mutual d-visibility number μd(G) of a graph G is introduced as the cardinality of the largest mutual d-visibility set. That is, X⊆V(G) is a mutual d-visibility set if for any pair of vertices x,y∈X, the distance between them is larger than d, or there exists a shortest x, y-path in G whose internal vertices are not in X. Several combinatorial and computational aspects of μd(G) are given in this work. Finally, the NP-completeness of the decision problem concerning finding μd(G) is proved.
Materias
d-mutual-visibility number; d-mutual-visibility set; Dissociation number; Mutual visibility; Packing number; Product graphsColecciones
- Artículos Científicos [12009]
- Articulos Científicos Est. I.O. [361]






