Hamiltonian path, routing, broadcasting algorithms for connected square network graphs
Connected Square Network Graphs (CSNG) in the study of Selcuk (2022) and Selcuk and Tankul (2022) is reconsidered in this paper. Although (CSNG) is a 2-dimensional mesh structure, the most important feature of this graph is that it is a hypercube variant. For this reason, this study focuses on devel...
Main Authors: | Burhan Selçuk, Ayşe Nur Altintaş Tankül |
---|---|
Format: | Article |
Language: | English |
Published: |
Elsevier
2023-08-01
|
Series: | Engineering Science and Technology, an International Journal |
Subjects: | |
Online Access: | http://www.sciencedirect.com/science/article/pii/S2215098623001325 |
Similar Items
-
DISTRIBUTED HAMILTONIAN PATH SEARCH ALGORITHM
by: Karol Grondžák
Published: (2010-12-01) -
Hamiltonian path of Mk -V
by: Eduardo Montenegro, et al.
Published: (2011-02-01) -
On k-Path Pancyclic Graphs
by: Bi Zhenming, et al.
Published: (2015-05-01) -
Decomposing the Complete Graph Into Hamiltonian Paths (Cycles) and 3-Stars
by: Lee Hung-Chih, et al.
Published: (2020-08-01) -
A New Proof that 4-Connected Planar Graphs are Hamiltonian-Connected
by: Lu Xiaoyun, et al.
Published: (2016-08-01)