RT journal article
T1 Mutual d-visibility in Graphs
A1 Kuziak, Dorota
A1 Montejano, Luis P.
A1 Rodríguez Velázquez, Juan A.
A2 Estadística e Investigación Operativa
K1 d-mutual-visibility number
K1 d-mutual-visibility set
K1 Dissociation number
K1 Mutual visibility
K1 Packing number
K1 Product graphs
AB 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.
PB Birkhauser
SN 1420-9012
YR 2025
FD 2025
LK http://hdl.handle.net/10498/38731
UL http://hdl.handle.net/10498/38731
LA eng
DS Repositorio Institucional de la Universidad de Cádiz
RD 08-nov-2026