%0 Journal Article 
%A Kuziak, Dorota
%A Montejano, Luis P.
%A Rodríguez Velázquez, Juan A.
%T Mutual d-visibility in Graphs
%D 2025
%@ 1420-9012

%U http://hdl.handle.net/10498/38731
%X 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.
%K d-mutual-visibility number
%K d-mutual-visibility set
%K Dissociation number
%K Mutual visibility
%K Packing number
%K Product graphs
%~ Universidad de Cádiz