| Title: | Mutual-visibility sets in cartesian products of paths and cycles |
|---|
| Authors: | ID Korže, Danilo (Author)
ID Vesel, Aleksander (Author) |
|---|
| Files: |  s00025-024-02139-x.pdf (596,74 KB)
MD5: 6696E5F9B93C9E7DD6BFC20CA0B8B0E1
 https://link.springer.com/article/10.1007/s00025-024-02139-x
|
|---|
| Language: | English |
|---|
| Work type: | Article |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | FERI - Faculty of Electrical Engineering and Computer Science
|
|---|
| Abstract: | For a given graph G, the mutual-visibility problem asks for the largest set of vertices M ⊆ V (G) with the property that for any pair of vertices u, v ∈ M there exists a shortest u, v-path of G that does not pass through any other vertex in M. The mutual-visibility problem for Cartesian products of a cycle and a path, as well as for Cartesian products of two cycles, is considered. Optimal solutions are provided for the majority of Cartesian products of a cycle and a path, while for the other family of graphs, the problem is completely solved. |
|---|
| Keywords: | mutual-visibility set, supermutual-visibility number, Cartesian product |
|---|
| Publication status: | Published |
|---|
| Publication version: | Version of Record |
|---|
| Submitted for review: | 30.08.2023 |
|---|
| Article acceptance date: | 21.01.2024 |
|---|
| Publication date: | 09.03.2024 |
|---|
| Publisher: | Springer Link; Birkhäuser |
|---|
| Year of publishing: | 2024 |
|---|
| Number of pages: | 20 str. |
|---|
| Numbering: | let. 79, št. članka 116 |
|---|
| PID: | 20.500.12556/DKUM-89847  |
|---|
| UDC: | 519.7 |
|---|
| ISSN on article: | 1422-6383 |
|---|
| COBISS.SI-ID: | 188475651 |
|---|
| DOI: | 10.1007/s00025-024-02139-x |
|---|
| Copyright: | 2024 The Author(s)
|
|---|
| Publication date in DKUM: | 14.08.2024 |
|---|
| Views: | 229 |
|---|
| Downloads: | 58 |
|---|
| Metadata: |    |
|---|
| Categories: | Misc.
|
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
