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

Celý popis

Podrobná bibliografia

Vydané v:	Applied mathematics and computation Ročník 419; s. 126850
Hlavný autor:	Di Stefano, Gabriele
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 15.04.2022
Predmet:	Computational complexity Graph classes Graph invariant Mutual visibility Mutual visibility Graph classes Graph invariant Computational complexity
ISSN:	0096-3003
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!