<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://repozitorij.uni-lj.si/IzpisGradiva.php?id=190769"><dc:title>Independent mutual-visibility sets and distance edge-critical graphs</dc:title><dc:creator>Tian,	Jing	(Avtor)
	</dc:creator><dc:creator>Bujtás,	Csilla	(Avtor)
	</dc:creator><dc:creator>Klavžar,	Sandi	(Avtor)
	</dc:creator><dc:subject>mutual-visibility set</dc:subject><dc:subject>independent set</dc:subject><dc:subject>distance edge-critical graph</dc:subject><dc:subject>dense diamond graph</dc:subject><dc:subject>computational complexity</dc:subject><dc:description>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. Diameter four graphs in which every independent set is a mutual-visibility set are characterized. 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.</dc:description><dc:date>2026</dc:date><dc:date>2026-11-03 13:08:36</dc:date><dc:type>Članek v reviji</dc:type><dc:identifier>190769</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
