Solving Edges Deletion Problem of Complete Graphs
As the network size increases, there is an increased probability that some components will
fail. It is therefore necessary for the network to be able to maintain the interconnection even …
fail. It is therefore necessary for the network to be able to maintain the interconnection even …
Diameter of generalized Petersen graphs
L Loudiki, M Kchikech, EH Essaky - arXiv preprint arXiv:2102.10397, 2021 - arxiv.org
Due to their broad application to different fields of theory and practice, generalized Petersen
graphs $ GPG (n, s) $ have been extensively investigated. Despite the regularity of …
graphs $ GPG (n, s) $ have been extensively investigated. Despite the regularity of …
On the Total Domination and Vertex Covering of the Standard Chessboard
AN Jasim - Wasit Journal for Pure sciences, 2024 - wjps.uowasit.edu.iq
The movement of pieces on chessboards has led to several problems. Many researchers
have solved some of these problems, but many of them remain unsolved. Graph theory is a …
have solved some of these problems, but many of them remain unsolved. Graph theory is a …
The diameter vulnerability of two-dimensional optimal circulant networks
EA Monakhova, OG Monakhov - Journal of Physics: Conference …, 2021 - iopscience.iop.org
This paper studies the effect of changing the diameter of the network in circulant networks of
dimension two with unreliable elements (nodes, links). The well-known (Δ, D, D', s)-problem …
dimension two with unreliable elements (nodes, links). The well-known (Δ, D, D', s)-problem …