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: | Cristian E. ONETE, Maria-Cristina C. ONETE |
---|---|
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 |
Similar Items
-
Beyond Grinberg Equation in Cubic Planar Graphs
by: Cristian E. ONETE, et al.
Published: (2019-04-01) -
Grafos hamiltonianos en el diseño de viajes
by: Cristina Jordán Lluch, et al.
Published: (2013-06-01) -
On the Integer-antimagic Spectra of Non-Hamiltonian Graphs
by: Wai Shiu, et al.
Published: (2022-07-01) -
A note on hamiltonicity conditions of the coprime and non-coprime graphs of a finite group
by: Muhammad Nurul Huda
Published: (2024-07-01) -
On Uniquely Hamiltonian Claw-Free and Triangle-Free Graphs
by: Seamone Ben
Published: (2015-05-01)