IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v26y2013i3d10.1007_s10878-012-9479-6.html
   My bibliography  Save this article

Minimum degree, edge-connectivity and radius

Author

Listed:
  • Baoyindureng Wu

    (Xinjiang University)

  • Xinhui An

    (Xinjiang University)

  • Guojie Liu

    (Xinjiang University)

  • Guiying Yan

    (Chinese Academy of Sciences)

  • Xiaoping Liu

    (Xinjiang Polytechnical College)

Abstract

Let G be a connected graph on n≥4 vertices with minimum degree δ and radius r. Then $\delta r\leq4\lfloor\frac{n}{2}\rfloor-4$ , with equality if and only if one of the following holds: (1) G is K 5, (2) G≅K n ∖M, where M is a perfect matching, if n is even, (3) δ=n−3 and Δ≤n−2, if n is odd. This solves a conjecture on the product of the edge-connectivity and radius of a graph, which was posed by Sedlar, Vukičević, Aouchice, and Hansen.

Suggested Citation

  • Baoyindureng Wu & Xinhui An & Guojie Liu & Guiying Yan & Xiaoping Liu, 2013. "Minimum degree, edge-connectivity and radius," Journal of Combinatorial Optimization, Springer, vol. 26(3), pages 585-591, October.
    • Handle: RePEc:spr:jcomop:v:26:y:2013:i:3:d:10.1007_s10878-012-9479-6
    DOI: 10.1007/s10878-012-9479-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-012-9479-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-012-9479-6?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. Hansen, Pierre & Mladenovic, Nenad & Moreno Pérez, Jos´e A., 2008. "Variable neighborhood search," European Journal of Operational Research, Elsevier, vol. 191(3), pages 593-595, December.
    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. Kexiang Xu & Haiqiong Liu & Kinkar Ch. Das & Sandi Klavžar, 2018. "Embeddings into almost self-centered graphs of given radius," Journal of Combinatorial Optimization, Springer, vol. 36(4), pages 1388-1410, November.
    2. Kinkar Ch. Das & M. J. Nadjafi-Arani, 2017. "On maximum Wiener index of trees and graphs with given radius," Journal of Combinatorial Optimization, Springer, vol. 34(2), pages 574-587, August.
    3. Leanne Roncolato & John Willoughby, 2017. "Job Quality Complexities," Review of Radical Political Economics, Union for Radical Political Economics, vol. 49(1), pages 30-53, March.
    4. Siva Venkadesh & Anthony Santarelli & Tyler Boesen & Hong-Wei Dong & Giorgio A. Ascoli, 2023. "Combinatorial quantification of distinct neural projections from retrograde tracing," Nature Communications, Nature, vol. 14(1), pages 1-10, December.

    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. Almeder, Christian & Hartl, Richard F., 2013. "A metaheuristic optimization approach for a real-world stochastic flexible flow shop problem with limited buffer," International Journal of Production Economics, Elsevier, vol. 145(1), pages 88-95.
    2. Ursavas, Evrim & Zhu, Stuart X., 2016. "Optimal policies for the berth allocation problem under stochastic nature," European Journal of Operational Research, Elsevier, vol. 255(2), pages 380-387.
    3. Zhen, Lu & Lee, Loo Hay & Chew, Ek Peng, 2011. "A decision model for berth allocation under uncertainty," European Journal of Operational Research, Elsevier, vol. 212(1), pages 54-68, July.
    4. Michael D König & Stefano Battiston & Mauro Napoletano & Frank Schweitzer, 2008. "The Efficiency and Evolution of R&D Networks," Working Papers hal-00973077, HAL.
    5. Xiao, Yiyong & Kaku, Ikou & Zhao, Qiuhong & Zhang, Renqian, 2011. "A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems," European Journal of Operational Research, Elsevier, vol. 214(2), pages 223-231, October.
    6. Du, Zhibin, 2017. "Further results regarding the sum of domination number and average eccentricity," Applied Mathematics and Computation, Elsevier, vol. 294(C), pages 299-309.
    7. Yves Crama & Michel Grabisch & Silvano Martello, 2022. "Sixty-one surveys in operations research," Annals of Operations Research, Springer, vol. 314(1), pages 5-13, July.
    8. J Blazewicz & T C E Cheng & M Machowiak & C Oguz, 2011. "Berth and quay crane allocation: a moldable task scheduling model," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(7), pages 1189-1197, July.
    9. Wawrzyniak, Jakub & Drozdowski, Maciej & Sanlaville, Éric, 2020. "Selecting algorithms for large berth allocation problems," European Journal of Operational Research, Elsevier, vol. 283(3), pages 844-862.
    10. Abraham Duarte & Eduardo G. Pardo, 2020. "Special issue on recent innovations in variable neighborhood search," Journal of Heuristics, Springer, vol. 26(3), pages 335-338, June.
    11. repec:hal:wpspec:info:hdl:2441/9935 is not listed on IDEAS
    12. repec:spo:wpecon:info:hdl:2441/9935 is not listed on IDEAS
    13. Jiang, Min & Leung, K.H. & Lyu, Zhongyuan & Huang, George Q., 2020. "Picking-replenishment synchronization for robotic forward-reserve warehouses," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 144(C).
    14. repec:hal:wpspec:info:hdl:2441/7346 is not listed on IDEAS
    15. Olivera Janković & Stefan Mišković & Zorica Stanimirović & Raca Todosijević, 2017. "Novel formulations and VNS-based heuristics for single and multiple allocation p-hub maximal covering problems," Annals of Operations Research, Springer, vol. 259(1), pages 191-216, December.
    16. Michael D. König & Claudio J. Tessone & Yves Zenou, 2010. "From Assortative To Dissortative Networks: The Role Of Capacity Constraints," Advances in Complex Systems (ACS), World Scientific Publishing Co. Pte. Ltd., vol. 13(04), pages 483-499.
    17. Mladenović, Nenad & Urošević, Dragan & Hanafi, Saı¨d & Ilić, Aleksandar, 2012. "A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 220(1), pages 270-285.
    18. Fan Bu & Heather Nachtmann, 2023. "Literature review and comparative analysis of inland waterways transport: “Container on Barge”," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 25(1), pages 140-173, March.
    19. , D. & Tessone, Claudio J. & ,, 2014. "Nestedness in networks: A theoretical model and some applications," Theoretical Economics, Econometric Society, vol. 9(3), September.
    20. Liu, Changchun, 2020. "Iterative heuristic for simultaneous allocations of berths, quay cranes, and yards under practical situations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 133(C).
    21. Javier Panadero & Jana Doering & Renatas Kizys & Angel A. Juan & Angels Fito, 2020. "A variable neighborhood search simheuristic for project portfolio selection under uncertainty," Journal of Heuristics, Springer, vol. 26(3), pages 353-375, June.
    22. Issam Krimi & Raca Todosijević & Rachid Benmansour & Mustapha Ratli & Abdessamad Ait Cadi & Afaf Aloullal, 2020. "Modelling and solving the multi-quays berth allocation and crane assignment problem with availability constraints," Journal of Global Optimization, Springer, vol. 78(2), pages 349-373, October.
    23. Xu, Dongsheng & Li, Chung-Lun & Leung, Joseph Y.-T., 2012. "Berth allocation with time-dependent physical limitations on vessels," European Journal of Operational Research, Elsevier, vol. 216(1), pages 47-56.

    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:spr:jcomop:v:26:y:2013:i:3:d:10.1007_s10878-012-9479-6. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.