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

Geodesic packing in graphs

Author

Listed:
  • Manuel, Paul
  • Brešar, Boštjan
  • Klavžar, Sandi

Abstract

A geodesic packing of a graph G is a set of vertex-disjoint maximal geodesics. The maximum cardinality of a geodesic packing is the geodesic packing number gpack(G). It is proved that the decision version of the geodesic packing number is NP-complete. We also consider the geodesic transversal number, gt(G), which is the minimum cardinality of a set of vertices that hit all maximal geodesics in G. While gt(G)≥gpack(G) in every graph G, the quotient gt(G)/gpack(G) is investigated. By using the rook's graph, it is proved that there does not exist a constant C<3 such that gt(G)gpack(G)≤C would hold for all graphs G. If T is a tree, then it is proved that gpack(T)=gt(T), and a linear algorithm for determining gpack(T) is derived. The geodesic packing number is also determined for the strong product of paths.

Suggested Citation

  • Manuel, Paul & Brešar, Boštjan & Klavžar, Sandi, 2023. "Geodesic packing in graphs," Applied Mathematics and Computation, Elsevier, vol. 459(C).
    • Handle: RePEc:eee:apmaco:v:459:y:2023:i:c:s0096300323004460
    DOI: 10.1016/j.amc.2023.128277
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300323004460
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2023.128277?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.

    References listed on IDEAS

    as
    1. Cicerone, Serafino & Di Stefano, Gabriele & Klavžar, Sandi, 2023. "On the mutual visibility in Cartesian products and triangle-free graphs," Applied Mathematics and Computation, Elsevier, vol. 438(C).
    2. Di Stefano, Gabriele, 2022. "Mutual visibility in graphs," Applied Mathematics and Computation, Elsevier, vol. 419(C).
    3. Manuel, Paul & Brešar, Boštjan & Klavžar, Sandi, 2022. "The geodesic-transversal problem," Applied Mathematics and Computation, Elsevier, vol. 413(C).
    4. Iztok Peterin & Gabriel Semanišin, 2021. "On the Maximal Shortest Paths Cover Number," Mathematics, MDPI, vol. 9(14), pages 1-10, July.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Brešar, Boštjan & Yero, Ismael G., 2024. "Lower (total) mutual-visibility number in graphs," Applied Mathematics and Computation, Elsevier, vol. 465(C).
    2. Manuel, Paul & Brešar, Boštjan & Klavžar, Sandi, 2022. "The geodesic-transversal problem," Applied Mathematics and Computation, Elsevier, vol. 413(C).
    3. Ting Wang & Yu Jiang & Jianye Yang & Lei Xing, 2023. "Edge-Based Minimal k -Core Subgraph Search," Mathematics, MDPI, vol. 11(15), pages 1-17, August.

    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:459:y:2023:i:c:s0096300323004460. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.