Abstract 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 …

The fractal cubic network graphs (FCNG) previously studied by Karci and Selcuk (2015) are
revised in this paper. First, general information about FCNG is given, and new topological …

In this study, connected square network graphs are introduced and two different definitions
are given. Firstly, connected square network graphs are shown to be a Hamilton graph …

A cycle in a graph G that contains all of its vertices is said to be the Hamiltonian cycle of that
graph. A Hamiltonian graph is one that has a Hamiltonian cycle. This article discusses how …

This thesis considers two problems. One problem is finding closed-form solutions for
equivalence computation of divisible workload origins from a sin-gle source in mesh and …

The fractal cubic network graphs ($ FCNG $) of Karci and Selcuk (2015) are revisited in this
paper. Firstly, general information about $ FCNG $ is given, and then new topological …

The graph is used as a mathematical model in many branches of science. Graphs are a
collaborative research field of mathematics and computer science. Hypercube graphs are …

In this paper, we investigated Hamiltonian properties of honeycomb meshes which are
created in two different ways. We obtained different Hamilton paths for Honeycomb Meshes …