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

The geodesic-transversal problem

Author

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

Abstract

A maximal geodesic in a graph is a geodesic (alias shortest path) which is not a subpath of a longer geodesic. The geodesic-transversal problem in a graph G is introduced as the task to find a smallest set S of vertices of G such that each maximal geodesic has at least one vertex in S. The minimum cardinality of such a set is the geodesic-transversal number gt(G) of G. It is proved that gt(G)=1 if and only if G is a subdivided star and that the geodesic-transversal problem is NP-complete. Fast algorithms to determine the geodesic-transversal number of trees and of spread cactus graphs are designed, respectively.

Suggested Citation

  • Manuel, Paul & Brešar, Boštjan & Klavžar, Sandi, 2022. "The geodesic-transversal problem," Applied Mathematics and Computation, Elsevier, vol. 413(C).
    • Handle: RePEc:eee:apmaco:v:413:y:2022:i:c:s0096300321007050
    DOI: 10.1016/j.amc.2021.126621
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300321007050
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2021.126621?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. Gómez, Daniel & Figueira, José Rui & Eusébio, Augusto, 2013. "Modeling centrality measures in social network analysis using bi-criteria network flow optimization problems," European Journal of Operational Research, Elsevier, vol. 226(2), pages 354-365.
    2. Karen E Joyce & Paul J Laurienti & Jonathan H Burdette & Satoru Hayasaka, 2010. "A New Measure of Centrality for Brain Networks," PLOS ONE, Public Library of Science, vol. 5(8), pages 1-13, August.
    3. Iztok Peterin & Gabriel Semanišin, 2021. "On the Maximal Shortest Paths Cover Number," Mathematics, MDPI, vol. 9(14), pages 1-10, July.
    4. Cong Li & Qian Li & Piet Mieghem & H. Stanley & Huijuan Wang, 2015. "Correlation between centrality metrics and their application to the opinion model," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 88(3), pages 1-13, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Manuel, Paul & Brešar, Boštjan & Klavžar, Sandi, 2023. "Geodesic packing in graphs," Applied Mathematics and Computation, Elsevier, vol. 459(C).

    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. Ruiz Vargas, E. & Mitchell, D.G.V. & Greening, S.G. & Wahl, L.M., 2014. "Topology of whole-brain functional MRI networks: Improving the truncated scale-free model," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 405(C), pages 151-158.
    2. Rusinowska, Agnieszka & Taalaibekova, Akylai, 2019. "Opinion formation and targeting when persuaders have extreme and centrist opinions," Journal of Mathematical Economics, Elsevier, vol. 84(C), pages 9-27.
    3. Zhao, Shuying & Sun, Shaowei, 2023. "Identification of node centrality based on Laplacian energy of networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 609(C).
    4. Rysz, Maciej & Mahdavi Pajouh, Foad & Pasiliao, Eduardo L., 2018. "Finding clique clusters with the highest betweenness centrality," European Journal of Operational Research, Elsevier, vol. 271(1), pages 155-164.
    5. Natarajan Meghanathan, 2019. "Unit Disk Graph-Based Node Similarity Index for Complex Network Analysis," Complexity, Hindawi, vol. 2019, pages 1-22, March.
    6. Seema Rani & Monica Mehrotra, 2019. "Community Detection in Social Networks: Literature Review," Journal of Information & Knowledge Management (JIKM), World Scientific Publishing Co. Pte. Ltd., vol. 18(02), pages 1-28, June.
    7. Vidal-Tomás, David, 2021. "Transitions in the cryptocurrency market during the COVID-19 pandemic: A network analysis," Finance Research Letters, Elsevier, vol. 43(C).
    8. Yin, Rongrong & Li, Linhui & Wang, Yumeng & Lang, Chun & Hao, Zhenyang & Zhang, Le, 2024. "Identifying critical nodes in complex networks based on distance Laplacian energy," Chaos, Solitons & Fractals, Elsevier, vol. 180(C).
    9. Li, Jin-Yue & Li, Xiang & Li, Cong, 2021. "The Kronecker-clique model for higher-order clustering coefficients," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 582(C).
    10. Xian Cheng & Shaoyi Liao & Zhongsheng Hua, 2017. "A policy of picking up parcels for express courier service in dynamic environments," International Journal of Production Research, Taylor & Francis Journals, vol. 55(9), pages 2470-2488, May.
    11. Saikou Y. Diallo & Christopher J. Lynch & Ross Gore & Jose J. Padilla, 2016. "Identifying key papers within a journal via network centrality measures," Scientometrics, Springer;Akadémiai Kiadó, vol. 107(3), pages 1005-1020, June.
    12. Bekiros, Stelios & Nguyen, Duc Khuong & Sandoval Junior, Leonidas & Uddin, Gazi Salah, 2017. "Information diffusion, cluster formation and entropy-based network dynamics in equity and commodity markets," European Journal of Operational Research, Elsevier, vol. 256(3), pages 945-961.
    13. Stephany Rajeh & Marinette Savonnet & Eric Leclercq & Hocine Cherifi, 2023. "Comparative evaluation of community-aware centrality measures," Quality & Quantity: International Journal of Methodology, Springer, vol. 57(2), pages 1273-1302, April.
    14. Gobbo, Simone Cristina de Oliveira & Mariano, Enzo Barberio & Gobbo Jr., José Alcides, 2021. "Combining social network and data envelopment analysis: A proposal for a Selection Employment Contracts Effectiveness index in healthcare network applications," Omega, Elsevier, vol. 103(C).
    15. Koopo Kwon & Sungchan Jun & Yong-Jae Lee & Sanghei Choi & Chulung Lee, 2022. "Logistics Technology Forecasting Framework Using Patent Analysis for Technology Roadmap," Sustainability, MDPI, vol. 14(9), pages 1-30, April.
    16. Hyundong Nam & Taewoo Nam, 2021. "Exploring Strategic Directions of Pandemic Crisis Management: A Text Analysis of World Economic Forum COVID-19 Reports," Sustainability, MDPI, vol. 13(8), pages 1-19, April.
    17. Arcagni, Alberto & Grassi, Rosanna & Stefani, Silvana & Torriero, Anna, 2017. "Higher order assortativity in complex networks," European Journal of Operational Research, Elsevier, vol. 262(2), pages 708-719.
    18. Almotahari, Amirmasoud & Yazici, Anil, 2021. "A computationally efficient metric for identification of critical links in large transportation networks," Reliability Engineering and System Safety, Elsevier, vol. 209(C).
    19. Ali Tosyali & Jeongsub Choi & Byunghoon Kim & Hoshin Lee & Myong K. Jeong, 2021. "A dynamic graph-based approach to ranking firms for identifying key players using inter-firm transactions," Annals of Operations Research, Springer, vol. 303(1), pages 5-27, August.
    20. Alessandro Avenali, 2014. "Relationships between centrality measures and VCG mechanism," DIAG Technical Reports 2014-05, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".

    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:413:y:2022:i:c:s0096300321007050. 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.