Network Evolution: Bugs, Superbugs, and Graph Infections
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 deli...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Stefan cel Mare University of Suceava
2023-10-01
|
| Series: | Journal of Applied Computer Science & Mathematics |
| Subjects: | |
| Online Access: | https://jacsm.ro/view/?pid=36_1 |
| Summary: | 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 graphbug infections and their effects. |
|---|---|
| ISSN: | 2066-4273 2066-3129 |