**Commenced**in January 2007

**Frequency:**Monthly

**Edition:**International

**Paper Count:**105

# Search results for: hamiltonian chaos

##### 105 Hamiltonian Factors in Hamiltonian Graphs

**Authors:**
Sizhong Zhou,
Bingyuan Pu

**Abstract:**

**Keywords:**
graph,
neighborhood,
factor,
Hamiltonian factor.

##### 104 A Sufficient Condition for Graphs to Have Hamiltonian [a, b]-Factors

**Authors:**
Sizhong Zhou

**Abstract:**

Let a and b be nonnegative integers with 2 ≤ a < b, and let G be a Hamiltonian graph of order n with n ≥ (a+b−4)(a+b−2) b−2 . An [a, b]-factor F of G is called a Hamiltonian [a, b]-factor if F contains a Hamiltonian cycle. In this paper, it is proved that G has a Hamiltonian [a, b]-factor if |NG(X)| > (a−1)n+|X|−1 a+b−3 for every nonempty independent subset X of V (G) and δ(G) > (a−1)n+a+b−4 a+b−3 .

**Keywords:**
graph,
minimum degree,
neighborhood,
[a,
b]-factor,
Hamiltonian [a,
b]-factor.

##### 103 Mutually Independent Hamiltonian Cycles of Cn x Cn

**Authors:**
Kai-Siou Wu,
Justie Su-Tzu Juan

**Abstract:**

In a graph G, a cycle is Hamiltonian cycle if it contain all vertices of G. Two Hamiltonian cycles C_1 = ⟨u_0, u_1, u_2, ..., u_{n−1}, u_0⟩ and C_2 = ⟨v_0, v_1, v_2, ..., v_{n−1}, v_0⟩ in G are independent if u_0 = v_0, u_i = ̸ v_i for all 1 ≤ i ≤ n−1. In G, a set of Hamiltonian cycles C = {C_1, C_2, ..., C_k} is mutually independent if any two Hamiltonian cycles of C are independent. The mutually independent Hamiltonicity IHC(G), = k means there exist a maximum integer k such that there exists k-mutually independent Hamiltonian cycles start from any vertex of G. In this paper, we prove that IHC(C_n × C_n) = 4, for n ≥ 3.

**Keywords:**
Hamiltonian,
independent,
cycle,
Cartesian product,
mutually independent Hamiltonicity

##### 102 The Panpositionable Hamiltonicity of k-ary n-cubes

**Authors:**
Chia-Jung Tsai,
Shin-Shin Kao

**Abstract:**

**Keywords:**
Hamiltonian,
panpositionable,
bipanpositionable,
k-ary n-cube.

##### 101 The Balanced Hamiltonian Cycle on the Toroidal Mesh Graphs

**Authors:**
Wen-Fang Peng,
Justie Su-Tzu Juan

**Abstract:**

The balanced Hamiltonian cycle problemis a quiet new topic of graph theorem. Given a graph G = (V, E), whose edge set can be partitioned into k dimensions, for positive integer k and a Hamiltonian cycle C on G. The set of all i-dimensional edge of C, which is a subset by E(C), is denoted as Ei(C).

**Keywords:**
Hamiltonian cycle,
balanced,
Cartesian product.

##### 100 A Hamiltonian Decomposition of 5-star

**Authors:**
Walter Hussak,
Heiko Schröder

**Abstract:**

Star graphs are Cayley graphs of symmetric groups of permutations, with transpositions as the generating sets. A star graph is a preferred interconnection network topology to a hypercube for its ability to connect a greater number of nodes with lower degree. However, an attractive property of the hypercube is that it has a Hamiltonian decomposition, i.e. its edges can be partitioned into disjoint Hamiltonian cycles, and therefore a simple routing can be found in the case of an edge failure. The existence of Hamiltonian cycles in Cayley graphs has been known for some time. So far, there are no published results on the much stronger condition of the existence of Hamiltonian decompositions. In this paper, we give a construction of a Hamiltonian decomposition of the star graph 5-star of degree 4, by defining an automorphism for 5-star and a Hamiltonian cycle which is edge-disjoint with its image under the automorphism.

**Keywords:**
interconnection networks,
paths and cycles,
graphs andgroups.

##### 99 A Further Study on the 4-Ordered Property of Some Chordal Ring Networks

**Authors:**
Shin-Shin Kao,
Hsiu-Chunj Pan

**Abstract:**

Given a graph G. A cycle of G is a sequence of vertices of G such that the first and the last vertices are the same. A hamiltonian cycle of G is a cycle containing all vertices of G. The graph G is k-ordered (resp. k-ordered hamiltonian) if for any sequence of k distinct vertices of G, there exists a cycle (resp. hamiltonian cycle) in G containing these k vertices in the specified order. Obviously, any cycle in a graph is 1-ordered, 2-ordered and 3- ordered. Thus the study of any graph being k-ordered (resp. k-ordered hamiltonian) always starts with k = 4. Most studies about this topic work on graphs with no real applications. To our knowledge, the chordal ring families were the first one utilized as the underlying topology in interconnection networks and shown to be 4-ordered. Furthermore, based on our computer experimental results, it was conjectured that some of them are 4-ordered hamiltonian. In this paper, we intend to give some possible directions in proving the conjecture.

**Keywords:**
Hamiltonian cycle,
4-ordered,
Chordal rings,
3-regular.

##### 98 A Systematic Approach for Finding Hamiltonian Cycles with a Prescribed Edge in Crossed Cubes

**Authors:**
Jheng-Cheng Chen,
Chia-Jui Lai,
Chang-Hsiung Tsai,

**Abstract:**

The crossed cube is one of the most notable variations of hypercube, but some properties of the former are superior to those of the latter. For example, the diameter of the crossed cube is almost the half of that of the hypercube. In this paper, we focus on the problem embedding a Hamiltonian cycle through an arbitrary given edge in the crossed cube. We give necessary and sufficient condition for determining whether a given permutation with n elements over Zn generates a Hamiltonian cycle pattern of the crossed cube. Moreover, we obtain a lower bound for the number of different Hamiltonian cycles passing through a given edge in an n-dimensional crossed cube. Our work extends some recently obtained results.

**Keywords:**
Interconnection network,
Hamiltonian,
crossed cubes,
prescribed edge.

##### 97 The Frequency Graph for the Traveling Salesman Problem

**Authors:**
Y. Wang

**Abstract:**

**Keywords:**
Traveling salesman problem,
frequency graph,
local
optimal Hamiltonian path,
four vertices and three lines inequality.

##### 96 Lyapunov Type Inequalities for Fractional Impulsive Hamiltonian Systems

**Authors:**
Kazem Ghanbari,
Yousef Gholami

**Abstract:**

**Keywords:**
Fractional derivatives and integrals,
Hamiltonian
system,
Lyapunov type inequalities,
stability,
disconjugacy.

##### 95 Dense Chaos in Coupled Map Lattices

**Authors:**
Tianxiu Lu,
Peiyong Zhu

**Abstract:**

This paper is mainly concerned with a kind of coupled map lattices (CMLs). New definitions of dense δ-chaos and dense chaos (which is a special case of dense δ-chaos with δ = 0) in discrete spatiotemporal systems are given and sufficient conditions for these systems to be densely chaotic or densely δ-chaotic are derived.

**Keywords:**
Discrete spatiotemporal systems,
coupled map lattices,
dense δ-chaos,
Li-Yorke pairs.

##### 94 Quantum Localization of Vibrational Mirror in Cavity Optomechanics

**Authors:**
Madiha Tariq,
Hena Rabbani

**Abstract:**

Recently, cavity-optomechanics becomes an extensive research field that has manipulated the mechanical effects of light for coupling of the optical field with other physical objects specifically with regards to dynamical localization. We investigate the dynamical localization (both in momentum and position space) for a vibrational mirror in a Fabry-Pérot cavity driven by a single mode optical field and a transverse probe field. The weak probe field phenomenon results in classical chaos in phase space and spatio temporal dynamics in position |ψ(x)²| and momentum space |ψ(p)²| versus time show quantum localization in both momentum and position space. Also, we discuss the parametric dependencies of dynamical localization for a designated set of parameters to be experimentally feasible. Our work opens an avenue to manipulate the other optical phenomena and applicability of proposed work can be prolonged to turn-able laser sources in the future.

**Keywords:**
Dynamical localization,
cavity optomechanics,
hamiltonian chaos,
probe field.

##### 93 Chaos Synchronization Using Sliding Mode Technique

**Authors:**
Behzad Khademian,
Mohammad Haeri

**Abstract:**

**Keywords:**
Sliding mode,
Chaos synchronization,
Modified
Chua's circuit.

##### 92 Robust Conversion of Chaos into an Arbitrary Periodic Motion

**Authors:**
Abolhassan Razminia,
Mohammad-Ali Sadrnia

**Abstract:**

One of the most attractive and important field of chaos theory is control of chaos. In this paper, we try to present a simple framework for chaotic motion control using the feedback linearization method. Using this approach, we derive a strategy, which can be easily applied to the other chaotic systems. This task presents two novel results: the desired periodic orbit need not be a solution of the original dynamics and the other is the robustness of response against parameter variations. The illustrated simulations show the ability of these. In addition, by a comparison between a conventional state feedback and our proposed method it is demonstrated that the introduced technique is more efficient.

**Keywords:**
chaos,
feedback linearization,
robust control,
periodic motion.

##### 91 Observer Design for Chaos Synchronization of Time-delayed Power Systems

**Authors:**
Jui-Sheng Lin,
Yi-Sung Yang,
Meei-Ling Hung,
Teh-Lu Liao,
Jun-Juh Yan

**Abstract:**

The global chaos synchronization for a class of time-delayed power systems is investigated via observer-based approach. By employing the concepts of quadratic stability theory and generalized system model, a new sufficient criterion for constructing an observer is deduced. In contrast to the previous works, this paper proposes a theoretical and systematic design procedure to realize chaos synchronization for master-slave power systems. Finally, an illustrative example is given to show the applicability of the obtained scheme.

**Keywords:**
Chaos,
Synchronization,
Quadratic stability theory,
Observer

##### 90 PSS and SVC Controller Design by Chaos and PSO Algorithms to Enhancing the Power System Stability

**Authors:**
Saeed jalilzadeh,
Mohammad Reza Safari Tirtashi,
Mohsen Sadeghi

**Abstract:**

**Keywords:**
PSS,
CHAOS,
PSO,
Stability

##### 89 An Efficient Hamiltonian for Discrete Fractional Fourier Transform

**Authors:**
Sukrit Shankar,
Pardha Saradhi K.,
Chetana Shanta Patsa,
Jaydev Sharma

**Abstract:**

**Keywords:**
Fractional Fourier Transform,
Hamiltonian,
Eigen
Vectors,
Discrete Hermite Gaussians.

##### 88 Anti-Synchronization of two Different Chaotic Systems via Active Control

**Authors:**
Amir Abbas Emadzadeh,
Mohammad Haeri

**Abstract:**

**Keywords:**
Active control,
Anti-Synchronization,
Chaos,
Lü system,
Rössler system.

##### 87 On Deterministic Chaos: Disclosing the Missing Mathematics from the Lorenz-Haken Equations

**Authors:**
Belkacem Meziane

**Abstract:**

The original 3D Lorenz-Haken equations -which describe laser dynamics- are converted into 2-second-order differential equations out of which the so far missing mathematics is extracted. Leaning on high-order trigonometry, important outcomes are pulled out: A fundamental result attributes chaos to forbidden periodic solutions, inside some precisely delimited region of the control parameter space that governs self-pulsing.

**Keywords:**
chaos,
Lorenz-Haken equations,
laser dynamics,
nonlinearities

##### 86 A Necessary Condition for the Existence of Chaos in Fractional Order Delay Differential Equations

**Authors:**
Sachin Bhalekar

**Abstract:**

In this paper we propose a necessary condition for the existence of chaos in delay differential equations of fractional order. To explain the proposed theory, we discuss fractional order Liu system and financial system involving delay.

**Keywords:**
Caputo derivative,
delay,
stability,
chaos.

##### 85 On Chvátal’s Conjecture for the Hamiltonicity of 1-Tough Graphs and Their Complements

**Authors:**
Shin-Shin Kao,
Yuan-Kang Shih,
Hsun Su

**Abstract:**

In this paper, we show that the conjecture of Chv tal, which states that any 1-tough graph is either a Hamiltonian graph or its complement contains a specific graph denoted by F, does not hold in general. More precisely, it is true only for graphs with six or seven vertices, and is false for graphs with eight or more vertices. A theorem is derived as a correction for the conjecture.

**Keywords:**
Complement,
degree sum,
Hamiltonian,
tough.

##### 84 An Augmented Automatic Choosing Control Designed by Extremizing a Combination of Hamiltonian and Lyapunov Functions for Nonlinear Systems with Constrained Input

**Authors:**
Toshinori Nawata,
Hitoshi Takata

**Abstract:**

In this paper we consider a nonlinear feedback control called augmented automatic choosing control (AACC) for nonlinear systems with constrained input. Constant terms which arise from section wise linearization of a given nonlinear system are treated as coefficients of a stable zero dynamics.Parameters included in the control are suboptimally selectedby extremizing a combination of Hamiltonian and Lyapunov functions with the aid of the genetic algorithm. This approach is applied to a field excitation control problem of power system to demonstrate the splendidness of the AACC. Simulation results show that the new controller can improve performance remarkably well.

**Keywords:**
Augmented Automatic Choosing Control,
NonlinearControl,
Genetic Algorithm,
Hamiltonian,
Lyapunovfunction

##### 83 Synchronization of Chaos in a Food Web in Ecological Systems

**Authors:**
Anuraj Singh,
Sunita Gakkhar

**Abstract:**

The three-species food web model proposed and investigated by Gakkhar and Naji is known to have chaotic behaviour for a choice of parameters. An attempt has been made to synchronize the chaos in the model using bidirectional coupling. Numerical simulations are presented to demonstrate the effectiveness and feasibility of the analytical results. Numerical results show that for higher value of coupling strength, chaotic synchronization is achieved. Chaos can be controlled to achieve stable synchronization in natural systems.

**Keywords:**
Lyapunov Exponent,
Bidirectional Coupling,
ChaosSynchronization,
Synchronization Manifold

##### 82 An Optimal Control Problem for Rigid Body Motions on Lie Group SO(2, 1)

**Authors:**
Nemat Abazari,
Ilgin Sager

**Abstract:**

In this paper smooth trajectories are computed in the Lie group SO(2, 1) as a motion planning problem by assigning a Frenet frame to the rigid body system to optimize the cost function of the elastic energy which is spent to track a timelike curve in Minkowski space. A method is proposed to solve a motion planning problem that minimize the integral of the square norm of Darboux vector of a timelike curve. This method uses the coordinate free Maximum Principle of Optimal control and results in the theory of integrable Hamiltonian systems. The presence of several conversed quantities inherent in these Hamiltonian systems aids in the explicit computation of the rigid body motions.

**Keywords:**
Optimal control,
Hamiltonian vector field,
Darboux vector,
maximum principle,
lie group,
Rigid body motion,
Lorentz metric.

##### 81 Linear Cryptanalysis for a Chaos-Based Stream Cipher

**Authors:**
Ruming Yin,
Jian Yuan,
Qiuhua Yang,
Xiuming Shan,
Xiqin Wang

**Abstract:**

Linear cryptanalysis methods are rarely used to improve the security of chaotic stream ciphers. In this paper, we apply linear cryptanalysis to a chaotic stream cipher which was designed by strictly using the basic design criterion of cryptosystem – confusion and diffusion. We show that this well-designed chaos-based stream cipher is still insecure against distinguishing attack. This distinguishing attack promotes the further improvement of the cipher.

**Keywords:**
Stream cipher,
chaos,
linear cryptanalysis,
distinguishing attack.

##### 80 Chaotic Dynamics of Cost Overruns in Oil and Gas Megaprojects: A Review

**Authors:**
O. J. Olaniran,
P. E. D. Love,
D. J. Edwards,
O. Olatunji,
J. Matthews

**Abstract:**

**Keywords:**
Chaos theory,
oil and gas,
cost overruns,
megaprojects.

##### 79 Planning Rigid Body Motions and Optimal Control Problem on Lie Group SO(2, 1)

**Authors:**
Nemat Abazari,
Ilgin Sager

**Abstract:**

In this paper smooth trajectories are computed in the Lie group SO(2, 1) as a motion planning problem by assigning a Frenet frame to the rigid body system to optimize the cost function of the elastic energy which is spent to track a timelike curve in Minkowski space. A method is proposed to solve a motion planning problem that minimizes the integral of the Lorentz inner product of Darboux vector of a timelike curve. This method uses the coordinate free Maximum Principle of Optimal control and results in the theory of integrable Hamiltonian systems. The presence of several conversed quantities inherent in these Hamiltonian systems aids in the explicit computation of the rigid body motions.

**Keywords:**
Optimal control,
Hamiltonian vector field,
Darboux vector,
maximum principle,
lie group,
rigid body motion,
Lorentz metric.

##### 78 Chua’s Circuit Regulation Using a Nonlinear Adaptive Feedback Technique

**Authors:**
Abolhassan Razminia,
Mohammad-Ali Sadrnia

**Abstract:**

Chua’s circuit is one of the most important electronic devices that are used for Chaos and Bifurcation studies. A central role of secure communication is devoted to it. Since the adaptive control is used vastly in the linear systems control, here we introduce a new trend of application of adaptive method in the chaos controlling field. In this paper, we try to derive a new adaptive control scheme for Chua’s circuit controlling because control of chaos is often very important in practical operations. The novelty of this approach is for sake of its robustness against the external perturbations which is simulated as an additive noise in all measured states and can be generalized to other chaotic systems. Our approach is based on Lyapunov analysis and the adaptation law is considered for the feedback gain. Because of this, we have named it NAFT (Nonlinear Adaptive Feedback Technique). At last, simulations show the capability of the presented technique for Chua’s circuit.

**Keywords:**
Chaos,
adaptive control,
nonlinear control,
Chua's circuit.

##### 77 Chaos-based Secure Communication via Continuous Variable Structure Control

**Authors:**
Cheng-Fang Huang,
Meei-Ling Hung,
Teh-Lu Liao,
Her-Terng Yau,
Jun-Juh Yan

**Abstract:**

**Keywords:**
Chaos,
Secure communication,
Synchronization,
Variable structure control (VSC)

##### 76 Solving SPDEs by a Least Squares Method

**Authors:**
Hassan Manouzi

**Abstract:**

We present in this paper a useful strategy to solve stochastic partial differential equations (SPDEs) involving stochastic coefficients. Using the Wick-product of higher order and the Wiener-Itˆo chaos expansion, the SPDEs is reformulated as a large system of deterministic partial differential equations. To reduce the computational complexity of this system, we shall use a decomposition-coordination method. To obtain the chaos coefficients in the corresponding deterministic equations, we use a least square formulation. Once this approximation is performed, the statistics of the numerical solution can be easily evaluated.

**Keywords:**
Least squares,
Wick product,
SPDEs,
finite element,
Wiener chaos expansion,
gradient method.