Fault-Free Hamiltonian Cycles in Balanced Hypercubes with Conditional Edge Faults

2019 ◽  
Vol 30 (05) ◽  
pp. 693-717 ◽  
Author(s):  
Pingshan Li ◽  
Min Xu
Keyword(s):  
Hamiltonian Cycle ◽  
Free Edge ◽  
Hamiltonian Cycles ◽  
Interesting Problem ◽  
Balanced Hypercube ◽  
Free Edges

The balanced hypercube, [Formula: see text], is a variant of hypercube [Formula: see text]. Zhou et al. [Inform. Sci. 300 (2015) 20–27] proposed an interesting problem that whether there is a fault-free Hamiltonian cycle in [Formula: see text] with each vertex incident to at least two fault-free edges. In this paper, we consider this problem and show that each fault-free edge lies on a fault-free Hamiltonian cycle in [Formula: see text] after no more than [Formula: see text] faulty edges occur if each vertex is incident with at least two fault-free edges for all [Formula: see text]. Our result is optimal with respect to the maximum number of tolerated edge faults.

Hamiltonicity of a class of toroidal graphs

2020 ◽  
Vol 70 (2) ◽  
pp. 497-503
Author(s):  
Dipendu Maity ◽  
Ashish Kumar Upadhyay
Keyword(s):  
Connected Graph ◽  
Hamiltonian Cycle ◽  
Partial Solution ◽  
The Other ◽  
Hamiltonian Cycles ◽  
The Face ◽  
Toroidal Graphs

Abstract If the face-cycles at all the vertices in a map are of same type then the map is said to be a semi-equivelar map. There are eleven types of semi-equivelar maps on the torus. In 1972 Altshuler has presented a study of Hamiltonian cycles in semi-equivelar maps of three types {36}, {44} and {63} on the torus. In this article we study Hamiltonicity of semi-equivelar maps of the other eight types {33, 42}, {32, 41, 31, 41}, {31, 61, 31, 61}, {34, 61}, {41, 82}, {31, 122}, {41, 61, 121} and {31, 41, 61, 41} on the torus. This gives a partial solution to the well known Conjecture that every 4-connected graph on the torus has a Hamiltonian cycle.

scholarly journals Semi-Degree Threshold for Anti-Directed Hamiltonian Cycles

10.37236/3610 ◽  
2015 ◽  
Vol 22 (4) ◽  
Author(s):  
Louis DeBiasio ◽  
Theodore Molla
Keyword(s):  
Directed Graph ◽  
Hamiltonian Cycle ◽  
Minimum Degree ◽  
Directed Graphs ◽  
Hamiltonian Cycles ◽  
Alternate Direction ◽  
Degree Conditions

In 1960 Ghouila-Houri extended Dirac's theorem to directed graphs by proving that if $D$ is a directed graph on $n$ vertices with minimum out-degree and in-degree at least $n/2$, then $D$ contains a directed Hamiltonian cycle. For directed graphs one may ask for other orientations of a Hamiltonian cycle and in 1980 Grant initiated the problem of determining minimum degree conditions for a directed graph $D$ to contain an anti-directed Hamiltonian cycle (an orientation in which consecutive edges alternate direction). We prove that for sufficiently large even $n$, if $D$ is a directed graph on $n$ vertices with minimum out-degree and in-degree at least $\frac{n}{2}+1$, then $D$ contains an anti-directed Hamiltonian cycle. In fact, we prove the stronger result that $\frac{n}{2}$ is sufficient unless $D$ is one of two counterexamples. This result is sharp.

scholarly journals DISTRIBUTED ALGORITHMS FOR BUILDING HAMILTONIAN CYCLES IN k-ARY n-CUBES AND HYPERCUBES WITH FAULTY LINKS

2007 ◽  
Vol 08 (03) ◽  
pp. 253-284 ◽  
Author(s):  
IAIN A. STEWART
Keyword(s):  
Distributed Algorithms ◽  
Distributed Algorithm ◽  
Hamiltonian Cycle ◽  
Sequential Algorithm ◽  
Hamiltonian Cycles ◽  
Cube Formula

We derive a sequential algorithm Find-Ham-Cycle with the following property. On input: k and n (specifying the k-ary n-cube [Formula: see text]); F, a set of at most 2n − 2 faulty links; and v , a node of [Formula: see text], the algorithm outputs nodes v + and v − such that if Find-Ham-Cycle is executed once for every node v of [Formula: see text] then the node v + (resp. v −) denotes the successor (resp. predecessor) node of v on a fixed Hamiltonian cycle in [Formula: see text] in which no link is in F. Moreover, the algorithm Find-Ham-Cycle runs in time polynomial in n and log k. We also obtain a similar algorithm for an n-dimensional hypercube with at most n − 2 faulty links. We use our algorithms to obtain distributed algorithms to embed Hamiltonian cycles k-ary n-cubes and hypercubes with faulty links; our hypercube algorithm improves on a recently-derived algorithm due to Leu and Kuo, and our k-ary n-cube algorithm is the first distributed algorithm for embedding a Hamiltonian cycle in a k-ary n-cube with faulty links.

Fault-free Hamiltonian cycle including given edges in folded hypercubes with faulty edges

2020 ◽  
Vol 12 (03) ◽  
pp. 2050036
Author(s):  
Dongqin Cheng
Keyword(s):  
Hamiltonian Cycle ◽  
Interconnection Network ◽  
Free Edge ◽  
Multiprocessor Systems ◽  
Linear Forest ◽  
Vertex Set ◽  
Vertex Disjoint ◽  
Folded Hypercube

The folded hypercube is an important interconnection network for multiprocessor systems. Let [Formula: see text] with [Formula: see text] denote an [Formula: see text]-dimensional folded hypercube. For a given fault-free edge set [Formula: see text] with [Formula: see text] and a faulty edge set [Formula: see text] with [Formula: see text], in this paper we prove that [Formula: see text] contains a fault-free Hamiltonian cycle including each edge of [Formula: see text] if and only if the subgraph induced by [Formula: see text] is linear forest. Furthermore, we give the definitions of the distance among three vertex-disjoint edges and the distance between a vertex and a vertex set. For three vertex-disjoint edges [Formula: see text], the distance among them is denoted by [Formula: see text]. For a vertex [Formula: see text] and a vertex set [Formula: see text], the distance between [Formula: see text] and [Formula: see text] is denoted by [Formula: see text].

scholarly journals Complexity of Hamiltonian Cycle Reconfiguration

Algorithms ◽  
2018 ◽  
Vol 11 (9) ◽  
pp. 140 ◽  
Author(s):  
Asahi Takaoka
Keyword(s):  
Hamiltonian Cycle ◽  
Linear Time ◽  
Bipartite Graphs ◽  
Interval Graph ◽  
Unit Interval ◽  
Chordal Graphs ◽  
Hamiltonian Cycles ◽  
Permutation Graph ◽  
Proper Subclass ◽  
Chordal Bipartite Graphs

The Hamiltonian cycle reconfiguration problem asks, given two Hamiltonian cycles C 0 and C t of a graph G, whether there is a sequence of Hamiltonian cycles C 0 , C 1 , … , C t such that C i can be obtained from C i − 1 by a switch for each i with 1 ≤ i ≤ t , where a switch is the replacement of a pair of edges u v and w z on a Hamiltonian cycle with the edges u w and v z of G, given that u w and v z did not appear on the cycle. We show that the Hamiltonian cycle reconfiguration problem is PSPACE-complete, settling an open question posed by Ito et al. (2011) and van den Heuvel (2013). More precisely, we show that the Hamiltonian cycle reconfiguration problem is PSPACE-complete for chordal bipartite graphs, strongly chordal split graphs, and bipartite graphs with maximum degree 6. Bipartite permutation graphs form a proper subclass of chordal bipartite graphs, and unit interval graphs form a proper subclass of strongly chordal graphs. On the positive side, we show that, for any two Hamiltonian cycles of a bipartite permutation graph and a unit interval graph, there is a sequence of switches transforming one cycle to the other, and such a sequence can be obtained in linear time.

The Effects of Inclined Free Edges on the Thermal Stresses in a Layered Beam

1993 ◽  
Vol 115 (2) ◽  
pp. 208-213 ◽  
Author(s):  
Wan-Lee Yin
Keyword(s):  
Thermal Stresses ◽  
Stress Singularity ◽  
Approximate Solutions ◽  
Free Edge ◽  
Local Concentration ◽  
Interlaminar Stresses ◽  
Beneficial Effects ◽  
Stress Functions ◽  
Layered Beam ◽  
Free Edges

A stress-function-based variational method is used to determine the thermal stresses in a layered beam with inclined free edges at the two ends. The stress functions are expressed in terms of oblique cartesian coordinates, and polynomial expansions of the stress functions with respect to the thickness coordinate are used to obtain approximate solutions. Severe interlaminar stresses act across end segments of the layer interfaces. Local concentration of such stresses may be significantly affected by the inclination angle of the end planes. Variational solutions for a two-layer beam show generally beneficial effects of free-edge inclination in dispersing the concentration of interlaminar stresses. The significance of these effects is generally not indicated by the power of the stress singularity as computed from an elasticity analysis of a bimaterial wedge.

Progressive Damage Analyses of Composite Laminates Exhibiting Free Edge Effects Using a New Micro-Meso Approach

2011 ◽  
Vol 471-472 ◽  
pp. 263-267
Author(s):  
Hossein Hosseini-Toudeshky ◽  
Amin Farrokhabadi ◽  
Bijan Mohammadi
Keyword(s):  
Edge Effects ◽  
Composite Laminates ◽  
Free Edge ◽  
Experimental Results ◽  
Progressive Damage ◽  
Stress Strain ◽  
Laminate Thickness ◽  
Stress Variations ◽  
Angle Ply Laminates ◽  
Free Edges

In this paper, the developed new micro-meso method by the authors is used for the edge-effects analyses of various angle-ply laminates such as [10/-10]2s and [30/-30]2s. It is shown that the obtained stress-strain behaviors of laminates are in well agreement with the available experimental results. The stress variations through the laminate thickness and near the free edges are also computed and compared with the available CDM results.

KNOTTED HAMILTONIAN CYCLES IN LINEAR EMBEDDING OF K7 INTO ℝ3

2012 ◽  
Vol 21 (14) ◽  
pp. 1250132 ◽  
Author(s):  
YOUNGSIK HUH
Keyword(s):  
Complete Graph ◽  
Hamiltonian Cycle ◽  
Hamiltonian Cycles ◽  
Intrinsic Properties ◽  
Linear Embedding

In 1983 Conway and Gordon proved that any embedding of the complete graph K7 into ℝ3 contains at least one nontrivial knot as its Hamiltonian cycle. After their work knots (also links) are considered as intrinsic properties of abstract graphs, and numerous subsequent works have been continued until recently. In this paper, we are interested in knotted Hamiltonian cycles in linear embedding of K7. Concretely it is shown that any linear embedding of K7 contains at most three figure-8 knots.

EDGE-BIPANCYCLICITY OF HYPERCUBES WITH CONDITIONAL FAULTS

2011 ◽  
Vol 12 (04) ◽  
pp. 337-343 ◽  
Author(s):  
CHAO-MING SUN
Keyword(s):  
Free Edge ◽  
Free Edges

In this paper, we consider the conditionally faulty graphs G that each vertex of G is incident with at least m fault-free edges, 2 ≤ m ≤ n - 1. We extend the limitation m ≥ 2 in all previous results of edge-bipancyclicity with faulty edges and faulty vertices. Let fe (respectively, fv) denotes the number of faulty edges (respectively, faulty vertices) in an n-dimensional hypercube Qn. For all m, we show that every fault-free edge of Qn lies on a fault-free cycle of every even length from 4 to |V| - 2fv inclusive provided fe + fv ≤ n - 2. This result is not only optimal, but also improves on the previously best known results reported in the literature.

scholarly journals Feasible Bases for a Polytope Related to the Hamilton Cycle Problem

2021 ◽  
Author(s):  
Thomas Kalinowski ◽  
Sogol Mohammadian
Keyword(s):  
Decision Process ◽  
Network Flow ◽  
Hamiltonian Cycle ◽  
Hamilton Cycle ◽  
Hamiltonian Cycles ◽  
Combinatorial Interpretation ◽  
Full Characterization ◽  
Computational Support ◽  
Markov Decision ◽  
Flow Polytope

We study a certain polytope depending on a graph G and a parameter β ∈ (0,1) that arises from embedding the Hamiltonian cycle problem in a discounted Markov decision process. Literature suggests a conjecture a lower bound on the proportion of feasible bases corresponding to Hamiltonian cycles in the set of all feasible bases. We make progress toward a proof of the conjecture by proving results about the structure of feasible bases. In particular, we prove three main results: (1) the set of feasible bases is independent of the parameter β when the parameter is close to one, (2) the polytope can be interpreted as a generalized network flow polytope, and (3) we deduce a combinatorial interpretation of the feasible bases. We also provide a full characterization for a special class of feasible bases, and we apply this to provide some computational support for the conjecture.

Sign in / Sign up

Export Citation Format

Share Document