Independent mutual-visibility sets and distance edge-critical graphs

TL;DR

This paper explores the relationships between independent sets and mutual-visibility sets in graphs, characterizes certain graph classes, and proves NP-hardness of related optimization problems.

Contribution

It establishes new characterizations of distance edge-critical graphs and analyzes mutual-visibility sets in various graph classes, including fullerenes.

Findings

Outer mutual-visibility sets are independent iff the graph is distance edge-critical.

Characterizations of graphs where all independent sets are mutual-visibility sets.

NP-hardness of maximizing mutual-visibility sets and related decision problems.

Abstract

In this paper, connections between independent sets and the variety of mutual-visibility sets are studied. It is proved that every outer mutual-visibility set of a graph is independent if and only if the graph is distance edge-critical. Several constructions yielding distance edge-critical graphs are given. Graphs in which every independent set is a total mutual-visibility or a dual mutual-visibility set are characterized, as well as graphs in which every total mutual-visibility set is independent. Along the way the total mutual-visibility number of some graphs derived from fullerenes is determined. Graphs in which every independent set is a mutual-visibility set are discussed and characterized over diameter four graphs. It is proved that determining the maximum cardinality of an independent mutual-visibility set and deciding whether it equals the independence number of a graph are NP-hard problems, and the same is true for independent total, outer and dual mutual-visibility sets.