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...

Full description

Bibliographic Details

Published in:	Applied mathematics and computation Vol. 419; p. 126850
Main Author:	Di Stefano, Gabriele
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 15.04.2022
Subjects:	Computational complexity Graph classes Graph invariant Mutual visibility Mutual visibility Graph classes Graph invariant Computational complexity
ISSN:	0096-3003
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!