@misc{10498/38731,
year = {2025},
url = {http://hdl.handle.net/10498/38731},
abstract = {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.},
publisher = {Birkhauser},
keywords = {d-mutual-visibility number},
keywords = {d-mutual-visibility set},
keywords = {Dissociation number},
keywords = {Mutual visibility},
keywords = {Packing number},
keywords = {Product graphs},
title = {Mutual d-visibility in Graphs},
doi = {10.1007/S00025-025-02450-1},
author = {Kuziak, Dorota and Montejano, Luis P. and Rodríguez Velázquez, Juan A.},
}