| Paper title: |
Network Evolution: Bugs, Superbugs, and Graph Infections |
| DOI: | https://doi.org/10.4316/JACSM.202302001 |
| Published in: | Issue 2, (Vol. 17) / 2023 |
| Publishing date: | 2023-10-16 |
| Pages: | 9-13 |
| Author(s): | ONETE Cristian E., ONETE Maria Cristina C. |
| Abstract. | In this paper we describe types of evolutions of networks (modelled as graphs) by analyzing the compositions between Hamiltonian graphs and graph “bugs”. We identify one type of “superbug”: a bug structure that can destroy the Hamiltonicity of a graph (and thus render a potentially- optimal delivery network inefficient), and also describe types of graph-bug infections and their effects |
| Keywords: | Hamiltonian Graphs, Non-Hamiltonian Graphs, Bugs, A-links, B-links. |
| References: | 1. Andrews, George E.,” Number Theory”, Dover Publications, Inc. New York, 1994. 2. Grinberg, È. Ja. (1968), "Plane homogeneous graphs of degree three without Hamiltonian circuits", Latvian Math. Yearbook 4 (in Russian), Riga: Izdat. “Zinatne”, pp. 51–58, MR 0238732. English translation by Dainis Zeps, arXiv:0908.2563. 3. C. Liebchen, and R. Rizzi,, Classes of Cycle Bases, TU Berlin, Report No. 2005/18. 4. Onete, C.E, M. C. C. Onete, "A Model For Expanding A Class Of Networks Preserving Original Network Properties Using The Indefinite Impedance Matrix," 2020 27th IEEE International Conference on Electronics, Circuits and Systems (ICECS), Glasgow, Scotland, UK, 2020, pp. 1-4, doi: 10.1109/ICECS49266.2020.9294961. 5. Onete, C.E, M. C. C. Onete, "Extending Two Classes Of Networks Using Three Topological Transformations," 2021 10th International Conference on Modern Circuits and Systems Technologies (MOCAST), 2021, pp. 1-4, doi: 10.1109/MOCAST52088.2021.9493353. 6. Onete, C.E, M.C.C. Onete, “Building hamiltonian networks using the laplacian of the underlying graph”, ISCAS 2015, pp. 145-148. 7. Onete, C.E, M.C.C. Onete, “Finding the Hamiltonian circuits in an undirected graph using the mesh-links incidence”, 19th IEEE International Conference Electronica, Circuits and Systems (ICECS), 2012, pp. 472-475. 8. Onete, C.E, M.C.C.Onete, “Beyond Grinberg Equation in cubic planar graphs”, Journal of Applied Computer Sciences and Mathematics (JACS&M), vol.13, No.1, 2019, pp19-24. 9. Schrijver, “Lattices and Linear Diophantine Equations”, www.math.tamu.edu/~Rojas/Schrijver. 10. Tutte, W.T., “Graph Theory as I have known it”,Oxford University Press, 2012, pp.21. Mathematics (JACS&M), vol.14, No.1, 2020,pp.20-24. 11. C.E.Onete, M.C.C.Onete, “Beyond Grinberg Equation in cubic planar graphs”, Journal of Applied Computer Sciences and Mathematics (JACS&M), vol.13, No.1, 2019, pp19-24. 12.Grinberg, È. Ja. (1968), "Plane homogeneous graphs of degree three without Hamiltonian circuits", Latvian Math. Yearbook 4 (in Russian), Riga: Izdat. “Zinatne”, pp. 51–58, MR 0238732. English translation by Dainis Zeps, arXiv:0908.2563. 13. Stopka O., Jeřábek K., Stopková M., Using the Operations Research Methods to Address Distribution Tasks at a City Logistics Scale, Transportation Research Procedia, Volume 44, 2020, Pages 348-355, ISSN 2352-1465. 14. Zaks, J., “Non-Hamiltonian Non-Grimbergian graphs”, Discrete Mathematics 17 , 1977, pp. 317-321
|
| Back to the journal content | |
