On some properties of graph irregularity indices with a particular regard to the σ-index
Author
Abstract
Suggested Citation
DOI: 10.1016/j.amc.2018.10.010
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- 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.
- 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.
- Gutman, Ivan, 2018. "Stepwise irregular graphs," Applied Mathematics and Computation, Elsevier, vol. 325(C), pages 234-238.
- van Dam, E.R., 1997.
"Nonregular Graphs with Three Eigenvalues,"
Research Memorandum
746, Tilburg University, School of Economics and Management.
- van Dam, E.R., 1998. "Nonregular graphs with three eigenvalues," Other publications TiSEM 3af29782-6c81-4e01-9d87-0, Tilburg University, School of Economics and Management.
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.- Mauro Napoletano & Stefano Battiston & Michael D König & Frank Schweitzer, 2008.
"The efficiency and evolution of R&D Networks,"
Working Papers
hal-01066189, HAL.
- Michael D. König & tefano Battiston & Mauro Napoletano & Frank Schweitzer, 2008. "The efficiency and evolution of R&D Networks," Documents de Travail de l'OFCE 2008-31, Observatoire Francais des Conjonctures Economiques (OFCE).
- Michael D König & Stefano Battiston & Mauro Napoletano & Frank Schweitzer, 2008. "The efficiency and evolution of R&D Networks," Post-Print hal-01053618, HAL.
- Michael D König & Stefano Battiston & Mauro Napoletano & Frank Schweitzer, 2008. "The Efficiency and Evolution of R&D Networks," SciencePo Working papers Main hal-00973077, HAL.
- Michael D König & Stefano Battiston & Mauro Napoletano & Frank Schweitzer, 2008. "The efficiency and evolution of R&D Networks," SciencePo Working papers Main hal-01053618, HAL.
- Mauro Napoletano & Stefano Battiston & Michael D König & Frank Schweitzer, 2008. "The efficiency and evolution of R&D Networks," SciencePo Working papers Main hal-01066189, HAL.
- Michael D König & Stefano Battiston & Mauro Napoletano & Frank Schweitzer, 2008. "The Efficiency and Evolution of R&D Networks," Working Papers hal-00973077, HAL.
- Michael D. König & S. Battiston & M. Napoletano & F. Schweitzer, 2008. "The Efficiency and Evolution of R&D Networks," CER-ETH Economics working paper series 08/95, CER-ETH - Center of Economic Research (CER-ETH) at ETH Zurich.
- repec:hal:wpspec:info:hdl:2441/9935 is not listed on IDEAS
- repec:spo:wpecon:info:hdl:2441/9935 is not listed on IDEAS
- repec:hal:wpspec:info:hdl:2441/7346 is not listed on IDEAS
- 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.
- Michael D. Konig & Claudio J. Tessone & Yves Zenou, "undated". "From Assortative to Dissortative Networks: The Role of Capacity Constraints," Working Papers CCSS-10-012, ETH Zurich, Chair of Systems Design.
- Zenou, Yves & Koenig, Michael & Tessone, Claudio J., 2010. "From Assortative to Dissortative Networks: The Role of Capacity Constraints," CEPR Discussion Papers 8052, C.E.P.R. Discussion Papers.
- , D. & Tessone, Claudio J. & ,, 2014.
"Nestedness in networks: A theoretical model and some applications,"
Theoretical Economics, Econometric Society, vol. 9(3), September.
- Zenou, Yves & Koenig, Michael & Tessone, Claudio J., 2012. "Nestedness in Networks: A Theoretical Model and Some Applications," CEPR Discussion Papers 8807, C.E.P.R. Discussion Papers.
- Michael Koenig & Claudio Tessone & Yves Zenou, 2012. "Nestedness in Networks: A Theoretical Model and Some Applications," Discussion Papers 11-003, Stanford Institute for Economic Policy Research.
- 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.
- Zenou, Yves & Koenig, Michael & Tessone, Claudio J., 2009. "A Dynamic Model of Network Formation with Strategic Interactions," CEPR Discussion Papers 7521, C.E.P.R. Discussion Papers.
- 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.
- repec:spo:wpecon:info:hdl:2441/7346 is not listed on IDEAS
- 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.
- repec:spo:wpmain:info:hdl:2441/9935 is not listed on IDEAS
- repec:hal:spmain:info:hdl:2441/9935 is not listed on IDEAS
- repec:hal:spmain:info:hdl:2441/7346 is not listed on IDEAS
- repec:spo:wpmain:info:hdl:2441/7346 is not listed on IDEAS
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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).
- 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.
- 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.
- van Dam, E.R. & Spence, E., 2004. "Combinatorial designs with two singular values - I. Uniform multiplicative designs," Other publications TiSEM cf3a75ce-99bd-442f-b177-4, Tilburg University, School of Economics and Management.
- 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.
- 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.
More about this item
Keywords
Graph irregularity; Complete split graph; Stepwise irregular graph;All these keywords.
Statistics
Access and download statisticsCorrections
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.