IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i5p885-d1606963.html
   My bibliography  Save this article

Center of Trapezoid Graph: Application in Selecting Center Location to Set up a Private Hospital

Author

Listed:
  • Shaoli Nandi

    (Department of Mathematics, Research Centre in Natural and Applied Sciences, Raja N. L. Khan Women’s College, Midnapore 721102, India
    Department of Mathematics, Government General Degree College, Salboni, Midnapore 721516, India)

  • Sukumar Mondal

    (Department of Mathematics, Research Centre in Natural and Applied Sciences, Raja N. L. Khan Women’s College, Midnapore 721102, India)

  • Sovan Samanta

    (Department of Mathematics, Tamralipta Mahavidyalaya, Tamluk 721636, India
    Department of Technical Sciences, Algebra University, Gradiscanska 24, 10000 Zagreb, Croatia
    Research Center of Performance and Productivity Analysis, Istinye University, Istanbul 34010, Türkiye)

  • Sambhu Charan Barman

    (Department of Mathematics, Shahid Matangini Hazra Government General Degree College for Women, Tamluk 721649, India)

  • Leo Mrsic

    (Department of Technical Sciences, Algebra University, Gradiscanska 24, 10000 Zagreb, Croatia
    Rudolfovo Science and Technology Centre, Podbreznik 15, 8000 Novo Mesto, Slovenia)

  • Antonios Kalampakas

    (College of Engineering and Technology, American University of the Middle East, Egaila 54200, Kuwait)

Abstract

The central location problem is a key aspect of graph theory, with a significant importance in various applications and studies within the field. The center of a graph is made up of nodes that have the smallest eccentricity, where eccentricity is defined as the greatest distance between a given node and any other node in the graph. To determine the graph’s center, it is essential to compute the eccentricity of each node. In this article, we explore various characteristics of the BFS tree of trapezoid graphs. We also present new properties that relate to the radius, diameter, and center of trapezoid graphs. For the trapezoid graph G , We prove that the difference between the d i a m e t e r ( G ) and the height of the BFS trees T t ( 1 ) , T t ( n ) , T t ( a ) , and T t ( b ) is at most one. We also establish relationship between r a d i u s ( G ) and d i a m e t e r ( G ) of trapezoid graphs. We also show that, to find the center of a trapezoid graph, it is not necessary to find the eccentricity of all vertices. Based on our studied results, we design an optimal algorithm for finding the center, radius, and diameter of trapezoid graphs. Also, we prove theoretically that our proposed algorithm compiles within O ( n ) time. We also find an algorithmic solution to real problems (that involves finding a center location in a district to build a private hospital that minimizes the farthest distance from it to all areas of the district) with the help of the trapezoid graph model and BFS trees within O ( n ) time.

Suggested Citation

  • Shaoli Nandi & Sukumar Mondal & Sovan Samanta & Sambhu Charan Barman & Leo Mrsic & Antonios Kalampakas, 2025. "Center of Trapezoid Graph: Application in Selecting Center Location to Set up a Private Hospital," Mathematics, MDPI, vol. 13(5), pages 1-20, March.
    • Handle: RePEc:gam:jmathe:v:13:y:2025:i:5:p:885-:d:1606963
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/5/885/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/13/5/885/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Miroslav Marić & Zorica Stanimirović & Srdjan Božović, 2015. "Hybrid metaheuristic method for determining locations for long-term health care facilities," Annals of Operations Research, Springer, vol. 227(1), pages 3-23, April.
    2. Dong-Guen Kim & Yeong-Dae Kim, 2013. "A Lagrangian heuristic algorithm for a public healthcare facility location problem," Annals of Operations Research, Springer, vol. 206(1), pages 221-240, 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. Derya Celik Turkoglu & Mujde Erol Genevois, 2020. "A comparative survey of service facility location problems," Annals of Operations Research, Springer, vol. 292(1), pages 399-468, September.
    2. Meisam Nasrollahi & Jafar Razmi, 2021. "A mathematical model for designing an integrated pharmaceutical supply chain with maximum expected coverage under uncertainty," Operational Research, Springer, vol. 21(1), pages 525-552, March.
    3. Mousazadeh, M. & Torabi, S. Ali & Pishvaee, M.S. & Abolhassani, F., 2018. "Accessible, stable, and equitable health service network redesign: A robust mixed possibilistic-flexible approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 111(C), pages 113-129.
    4. Soumen Kumar Das & Sankar Kumar Roy & Gerhard Wilhelm Weber, 2020. "An exact and a heuristic approach for the transportation-p-facility location problem," Computational Management Science, Springer, vol. 17(3), pages 389-407, October.
    5. Sanjay Dominik Jena & Jean-François Cordeau & Bernard Gendron, 2017. "Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 388-404, August.
    6. Maryam Radman & Kourosh Eshghi, 2018. "Designing a multi-service healthcare network based on the impact of patients’ flow among medical services," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(3), pages 637-678, July.
    7. Jesica Armas & Angel A. Juan & Joan M. Marquès & João Pedro Pedroso, 2017. "Solving the deterministic and stochastic uncapacitated facility location problem: from a heuristic to a simheuristic," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(10), pages 1161-1176, October.
    8. Elorza, María Eugenia & Moscoso, Nebel Silvana & Blanco, Anibal Manuel, 2022. "Assessing performance in health care: A mathematical programming approach for the re-design of primary health care networks," Socio-Economic Planning Sciences, Elsevier, vol. 84(C).
    9. Sagarkumar Hirpara & Monit Vaishnav & Pratik J. Parikh & Nan Kong & Priti Parikh, 2022. "Locating trauma centers considering patient safety," Health Care Management Science, Springer, vol. 25(2), pages 291-310, June.
    10. Soheil Davari, 2019. "The incremental cooperative design of preventive healthcare networks," Annals of Operations Research, Springer, vol. 272(1), pages 445-492, January.
    11. S. Khodaparasti & H. R. Maleki & S. Jahedi & M. E. Bruni & P. Beraldi, 2017. "Enhancing community based health programs in Iran: a multi-objective location-allocation model," Health Care Management Science, Springer, vol. 20(4), pages 485-499, December.
    12. Mendoza-Gómez, Rodolfo & Ríos-Mercado, Roger Z., 2022. "Regionalization of primary health care units with multi-institutional collaboration," Socio-Economic Planning Sciences, Elsevier, vol. 83(C).
    13. Li Wang & Huan Shi & Lu Gan, 2018. "Healthcare Facility Location-Allocation Optimization for China’s Developing Cities Utilizing a Multi-Objective Decision Support Approach," Sustainability, MDPI, vol. 10(12), pages 1-22, December.

    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:gam:jmathe:v:13:y:2025:i:5:p:885-:d:1606963. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.