Lower (total) mutual-visibility number in graphs

Boštjan Brešar and Ismael G. Yero

Applied Mathematics and Computation, 2024, vol. 465, issue C

Abstract: Given a graph G, a set X of vertices in G satisfying that between every two vertices in X (respectively, in G) there is a shortest path whose internal vertices are not in X is a mutual-visibility (respectively, total mutual-visibility) set in G. The cardinality of a largest (total) mutual-visibility set in G is known under the name (total) mutual-visibility number, and has been studied in several recent works.

Keywords: Mutual-visibility set; Mutual-visibility number; Total mutual-visibility set; Computational complexity (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300323005805
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:465:y:2024:i:c:s0096300323005805

DOI: 10.1016/j.amc.2023.128411

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().