Edge spans and the minimal number of steps for keeping the safety distance
In several recent papers, the maximal safety distance that two players can maintain while moving through a graph has been defined and studied using three different spans of the graph, each with different movement conditions. In this paper, we analyze the values of these three edge spans, which repre...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Šubašić, Aljoša Vojković, Tanja |
| description | In several recent papers, the maximal safety distance that two players can
maintain while moving through a graph has been defined and studied using three
different spans of the graph, each with different movement conditions. In this
paper, we analyze the values of these three edge spans, which represent the
maximal safety distance that two players can maintain while visiting all the
edges of the graph. We present results for various graph classes and examine
the relationship between edge spans and vertex spans. Additionally, we provide
some findings on the minimal number of steps required for walks through a graph
to visit all the vertices or edges while maintaining the maximal safety
distance. |
| doi_str_mv | 10.48550/arxiv.2306.06714 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2306_06714</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2306_06714</sourcerecordid><originalsourceid>FETCH-LOGICAL-a674-312a213a281e21ccfde0db5a1b22ee58b95fef9c053dd7db097feb2a99a8a8363</originalsourceid><addsrcrecordid>eNotz71OwzAUBWAvDKjwAEzcF0jwT5zYI6rKnyqxdI-u4-vWauNGdkD07YHAdJajo_Mxdid43Rit-QPmr_hZS8XbmredaK7Z28bvCcqEqQAmD_OBYIwpjniC9DE6ynAOUGaaCoRzhiPRFNN-6RUMNF_AxzJjGuiGXQU8Fbr9zxXbPW1265dq-_78un7cVth2TaWERCkUSiNIimEInrh3GoWTkkgbZ3WgYAeulfedd9x2gZxEa9GgUa1asfu_2QXTT_nna770v6h-QalvOM1H9A</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Edge spans and the minimal number of steps for keeping the safety distance</title><source>arXiv.org</source><creator>Šubašić, Aljoša ; Vojković, Tanja</creator><creatorcontrib>Šubašić, Aljoša ; Vojković, Tanja</creatorcontrib><description>In several recent papers, the maximal safety distance that two players can
maintain while moving through a graph has been defined and studied using three
different spans of the graph, each with different movement conditions. In this
paper, we analyze the values of these three edge spans, which represent the
maximal safety distance that two players can maintain while visiting all the
edges of the graph. We present results for various graph classes and examine
the relationship between edge spans and vertex spans. Additionally, we provide
some findings on the minimal number of steps required for walks through a graph
to visit all the vertices or edges while maintaining the maximal safety
distance.</description><identifier>DOI: 10.48550/arxiv.2306.06714</identifier><language>eng</language><subject>Mathematics - Combinatorics</subject><creationdate>2023-06</creationdate><rights>http://creativecommons.org/licenses/by-nc-nd/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2306.06714$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2306.06714$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Šubašić, Aljoša</creatorcontrib><creatorcontrib>Vojković, Tanja</creatorcontrib><title>Edge spans and the minimal number of steps for keeping the safety distance</title><description>In several recent papers, the maximal safety distance that two players can
maintain while moving through a graph has been defined and studied using three
different spans of the graph, each with different movement conditions. In this
paper, we analyze the values of these three edge spans, which represent the
maximal safety distance that two players can maintain while visiting all the
edges of the graph. We present results for various graph classes and examine
the relationship between edge spans and vertex spans. Additionally, we provide
some findings on the minimal number of steps required for walks through a graph
to visit all the vertices or edges while maintaining the maximal safety
distance.</description><subject>Mathematics - Combinatorics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz71OwzAUBWAvDKjwAEzcF0jwT5zYI6rKnyqxdI-u4-vWauNGdkD07YHAdJajo_Mxdid43Rit-QPmr_hZS8XbmredaK7Z28bvCcqEqQAmD_OBYIwpjniC9DE6ynAOUGaaCoRzhiPRFNN-6RUMNF_AxzJjGuiGXQU8Fbr9zxXbPW1265dq-_78un7cVth2TaWERCkUSiNIimEInrh3GoWTkkgbZ3WgYAeulfedd9x2gZxEa9GgUa1asfu_2QXTT_nna770v6h-QalvOM1H9A</recordid><startdate>20230611</startdate><enddate>20230611</enddate><creator>Šubašić, Aljoša</creator><creator>Vojković, Tanja</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20230611</creationdate><title>Edge spans and the minimal number of steps for keeping the safety distance</title><author>Šubašić, Aljoša ; Vojković, Tanja</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a674-312a213a281e21ccfde0db5a1b22ee58b95fef9c053dd7db097feb2a99a8a8363</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Mathematics - Combinatorics</topic><toplevel>online_resources</toplevel><creatorcontrib>Šubašić, Aljoša</creatorcontrib><creatorcontrib>Vojković, Tanja</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Šubašić, Aljoša</au><au>Vojković, Tanja</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Edge spans and the minimal number of steps for keeping the safety distance</atitle><date>2023-06-11</date><risdate>2023</risdate><abstract>In several recent papers, the maximal safety distance that two players can
maintain while moving through a graph has been defined and studied using three
different spans of the graph, each with different movement conditions. In this
paper, we analyze the values of these three edge spans, which represent the
maximal safety distance that two players can maintain while visiting all the
edges of the graph. We present results for various graph classes and examine
the relationship between edge spans and vertex spans. Additionally, we provide
some findings on the minimal number of steps required for walks through a graph
to visit all the vertices or edges while maintaining the maximal safety
distance.</abstract><doi>10.48550/arxiv.2306.06714</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.2306.06714 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_2306_06714 |
| source | arXiv.org |
| subjects | Mathematics - Combinatorics |
| title | Edge spans and the minimal number of steps for keeping the safety distance |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-21T18%3A39%3A09IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Edge%20spans%20and%20the%20minimal%20number%20of%20steps%20for%20keeping%20the%20safety%20distance&rft.au=%C5%A0uba%C5%A1i%C4%87,%20Aljo%C5%A1a&rft.date=2023-06-11&rft_id=info:doi/10.48550/arxiv.2306.06714&rft_dat=%3Carxiv_GOX%3E2306_06714%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |