Mutual visibility in graphs

Let G=(V,E) be a graph and P⊆V a set of points. Two points are mutually visible if there is a shortest path between them without further points. P is a mutual-visibility set if its points are pairwise mutually visible. The mutual-visibility number of G is the size of any largest mutual-visibility se...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Applied mathematics and computation Jg. 419; S. 126850
1. Verfasser:	Di Stefano, Gabriele
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Inc 15.04.2022
Schlagworte:	Computational complexity Graph classes Graph invariant Mutual visibility Mutual visibility Graph classes Graph invariant Computational complexity
ISSN:	0096-3003
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!