IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v344-345y2019ip107-115.html
   My bibliography  Save this article

On some properties of graph irregularity indices with a particular regard to the σ-index

Author

Listed:
  • Réti, Tamás

Abstract

Some well-known graph irregularity indices of a connected graph G are investigated. Our study is focused mainly on the comparison of the Bell’s degree-variance (Var(G)) and the Collatz–Sinogowitz irregularity index (CS(G)) with the recently introduced σ(G) irregularity index. It is a degree-based topological invariant calculated as σ(G)=F(G)−2M2(G) where M2(G) is the second Zagreb index, F(G)=∑d3(v), and d(v) is the degree of the vertex v in G. By introducing the notion of the complete split-like graphs representing a broad subclass of bidegreed connected graphs, it is shown that for these graphs the equality σ(G)=n2Var(G) holds.

Suggested Citation

  • Réti, Tamás, 2019. "On some properties of graph irregularity indices with a particular regard to the σ-index," Applied Mathematics and Computation, Elsevier, vol. 344, pages 107-115.
    • Handle: RePEc:eee:apmaco:v:344-345:y:2019:i::p:107-115
    DOI: 10.1016/j.amc.2018.10.010
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300318308701
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2018.10.010?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. Aouchiche, M. & Bell, F.K. & Cvetkovic, D. & Hansen, P. & Rowlinson, P. & Simic, S.K. & Stevanovic, D., 2008. "Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph," European Journal of Operational Research, Elsevier, vol. 191(3), pages 661-676, December.
    2. 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.
    3. Gutman, Ivan, 2018. "Stepwise irregular graphs," Applied Mathematics and Computation, Elsevier, vol. 325(C), pages 234-238.
    4. van Dam, E.R., 1997. "Nonregular Graphs with Three Eigenvalues," Research Memorandum 746, Tilburg University, School of Economics and Management.
    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. Michael D König & Stefano Battiston & Mauro Napoletano & Frank Schweitzer, 2008. "The Efficiency and Evolution of R&D Networks," Working Papers hal-00973077, HAL.
    2. repec:hal:wpspec:info:hdl:2441/9935 is not listed on IDEAS
    3. repec:spo:wpecon:info:hdl:2441/9935 is not listed on IDEAS
    4. repec:hal:wpspec:info:hdl:2441/7346 is not listed on IDEAS
    5. 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.
    6. , D. & Tessone, Claudio J. & ,, 2014. "Nestedness in networks: A theoretical model and some applications," Theoretical Economics, Econometric Society, vol. 9(3), September.
    7. M. Koenig & Claudio J. Tessone & Yves Zenou, "undated". "A Dynamic Model of Network Formation with Strategic Interactions," Working Papers CCSS-09-006, ETH Zurich, Chair of Systems Design.
    8. Pierre Hansen & Nenad Mladenović & José Moreno Pérez, 2010. "Variable neighbourhood search: methods and applications," Annals of Operations Research, Springer, vol. 175(1), pages 367-407, March.
    9. repec:spo:wpecon:info:hdl:2441/7346 is not listed on IDEAS
    10. König, Michael D. & Battiston, Stefano & Napoletano, Mauro & Schweitzer, Frank, 2012. "The efficiency and stability of R&D networks," Games and Economic Behavior, Elsevier, vol. 75(2), pages 694-713.
    11. repec:hal:spmain:info:hdl:2441/9933 is not listed on IDEAS
    12. repec:hal:spmain:info:hdl:2441/9935 is not listed on IDEAS
    13. repec:hal:spmain:info:hdl:2441/7346 is not listed on IDEAS
    14. 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.
    15. 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.
    16. 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.
    17. 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.
    18. 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.
    19. 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.
    20. 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.
    21. 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.
    22. 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.
    23. 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).
    24. 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.
    25. van Dam, E.R. & Spence, E., 2003. "Combinatorial Designs with Two Singular Values I. Uniform Multiplicative Designs," Discussion Paper 2003-67, Tilburg University, Center for Economic Research.
    26. 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.
    27. 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.

    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:344-345:y:2019:i::p:107-115. 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.