Survey on path and cycle embedding in some networks
JM Xu, M Ma - Frontiers of mathematics in China, 2009 - Springer
To find a cycle (resp. path) of a given length in a graph is the cycle (resp. path) embedding
problem. To find cycles of all lengths from its girth to its order in a graph is the pancyclic …
problem. To find cycles of all lengths from its girth to its order in a graph is the pancyclic …
A protection routing with secure mechanism in Möbius cubes
The protection routing uses the multi-paths technique for integrating route discovery and
route maintenance mechanisms in a network, and thus it can tolerate the failure of one …
route maintenance mechanisms in a network, and thus it can tolerate the failure of one …
Constructive algorithm of independent spanning trees on Möbius cubes
B Cheng, J Fan, X Jia, S Zhang… - The Computer …, 2013 - ieeexplore.ieee.org
Independent spanning trees (ISTs) on networks have applications in networks such as
reliable communication protocols, the multi-node broadcasting, one-to-all broadcasting …
reliable communication protocols, the multi-node broadcasting, one-to-all broadcasting …
Independent spanning trees in crossed cubes
B Cheng, J Fan, X Jia, S Zhang - Information Sciences, 2013 - Elsevier
Multiple independent spanning trees (ISTs) can be used for data broadcasting in networks,
which can provide advantageous performances, such as the enhancement of fault …
which can provide advantageous performances, such as the enhancement of fault …
Torus-like graphs and their paired many-to-many disjoint path covers
JH Park - Discrete Applied Mathematics, 2021 - Elsevier
Given two disjoint vertex-sets, S={s 1,…, sk} and T={t 1,…, tk} in a graph, a paired many-to-
many k-disjoint path cover joining S and T is a set of pairwise vertex-disjoint paths {P 1,…, P …
many k-disjoint path cover joining S and T is a set of pairwise vertex-disjoint paths {P 1,…, P …
Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes
RW Hung - Theoretical computer science, 2011 - Elsevier
The n-dimensional hypercube network Qn is one of the most popular interconnection
networks since it has simple structure and is easy to implement. The n-dimensional locally …
networks since it has simple structure and is easy to implement. The n-dimensional locally …
Fault-tolerant cycle-embedding in alternating group graphs
Cycle-embedding is an important issue in evaluating the efficiency of interconnection
networks and is also an extension of the theoretical research on Hamiltonicity. In this paper …
networks and is also an extension of the theoretical research on Hamiltonicity. In this paper …
Pancyclicity of restricted hypercube-like networks under the conditional fault model
A graph G is said to be conditional k-edge-fault pancyclic if after removing k faulty edges
from G, under the assumption that each node is incident to at least two fault-free edges, the …
from G, under the assumption that each node is incident to at least two fault-free edges, the …
Panconnectivity and edge‐pancyclicity of k‐ary n‐cubes
SY Hsieh, TJ Lin - Networks: An International Journal, 2009 - Wiley Online Library
In this article, we study some topological properties of k‐ary n‐cubes Q. We show that each
edge in Q lies on a cycle of every length from k to kn. We also show that Q is both …
edge in Q lies on a cycle of every length from k to kn. We also show that Q is both …
[PDF][PDF] A Fault-Handling Method for the Hamiltonian Cycle in the Hypercube Topology.
Many routing protocols, such as distance vector and link-state protocols are used for finding
the best paths in a network. To find the path between the source and destination nodes …
the best paths in a network. To find the path between the source and destination nodes …