IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v500y2025ics0096300325001602.html
   My bibliography  Save this article

Graphs with span 1 and shortest optimal walks

Author

Listed:
  • Dravec, Tanja
  • Mikalački, Mirjana
  • Taranenko, Andrej

Abstract

A span of a given graph G is the maximum distance that two players can keep at all times while visiting all vertices (edges) of G and moving according to certain rules, that produces different variants of span. We prove that the vertex and edge span of the same variant can differ by at most 1 and present a graph where the difference is exactly 1. For all variants of vertex span we present a lower bound in terms of the girth of the graph. Then we study graphs with the strong vertex span equal to 1. We present some nice properties of such graphs and show that interval graphs are contained in the class of graphs having the strong vertex span equal to 1. Finally, we present an algorithm that returns the minimum number of moves needed for both players to traverse all vertices of the given graph G such that in each move the distance between players equals at least the chosen vertex span of G.

Suggested Citation

  • Dravec, Tanja & Mikalački, Mirjana & Taranenko, Andrej, 2025. "Graphs with span 1 and shortest optimal walks," Applied Mathematics and Computation, Elsevier, vol. 500(C).
    • Handle: RePEc:eee:apmaco:v:500:y:2025:i:c:s0096300325001602
    DOI: 10.1016/j.amc.2025.129433
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300325001602
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2025.129433?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:500:y:2025:i:c:s0096300325001602. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.