On traceable iterated line graph and hamiltonian path index

Xiong and Liu[21]gave a characterization of the graphs G for which the n-iterated line graph L^(n)(G)is hamiltonian,for n≥2.In this paper,we study the existence of a hamiltonian path in L^(n)(G),and give a characterization of G for which L^(n)(G)has a hamiltonian path.As applications,we use this characterization to give several upper bounds on the hamiltonian path index of a graph.

Crossing Limit Cycles of Planar Piecewise Hamiltonian Systems with Linear Centers Separated by Two Parallel Straight Lines

In this paper, we have studied several classes of planar piecewise Hamiltonian systems with three zones separated by two parallel straight lines. Firstly, we give the maximal number of limit cycles in these classes of systems with a center in two zones and without equilibrium points in the other zone (or with a center in one zone and without equilibrium points in the other zones). In addition, we also give examples to illustrate that it can reach the maximal number.

Comparison among Classical,Probabilistic and Quantum Algorithms for Hamiltonian Cycle Problem

The Hamiltonian cycle problem(HCP),which is an NP-complete problem,consists of having a graph G with n nodes and m edges and finding the path that connects each node exactly once.In this paper we compare some algorithms to solve a Hamiltonian cycle problem,using different models of computations and especially the probabilistic and quantum ones.Starting from the classical probabilistic approach of random walks,we take a step to the quantum direction by involving an ad hoc designed Quantum Turing Machine(QTM),which can be a useful conceptual project tool for quantum algorithms.Introducing several constraints to the graphs,our analysis leads to not-exponential speedup improvements to the best-known algorithms.In particular,the results are based on bounded degree graphs(graphs with nodes having a maximum number of edges)and graphs with the right limited number of nodes and edges to allow them to outperform the other algorithms.

PATHS AND CYCLES EMBEDDING ON FAULTY ENHANCED HYPERCUBE NETWORKS

Let Qn,k （n 〉 3, 1 〈 k ≤ n - 1） be an n-dimensional enhanced hypercube which is an attractive variant of the hypercube and can be obtained by adding some complementary edges, fv and fe be the numbers of faulty vertices and faulty edges, respectively. In this paper, we give three main results. First, a fault-free path P[u, v] of length at least 2n - 2fv - 1 （respectively, 2n - 2fv - 2） can be embedded on Qn,k with fv ＋ f≤ n- 1 when dQn,k （u, v） is odd （respectively, dQ,~,k （u, v） is even）. Secondly, an Q,,k is （n - 2） edgefault-free hyper Hamiltonianaceable when n （ 3） and k have the same parity. Lastly, a fault-free cycle of length at least 2n - 2fv can be embedded on Qn,k with f~ 〈 n - 1 and fv＋f≤2n-4.

Light-Front Hamiltonian, Path Integral and BRST Formulations of the Chern-Simons Theory under Appropriate Gauge-Fixing

The Chern-Simons theory in two-space one-time dimensions is quantized on the light-front under appropriate gauge-fixing conditions using the Hamiltonian, path integral and BRST formulations.

DISCUSSION ON MINIMUM FLOW MODEL FOR ITS RELATIONSHIP WITH HAMILTONIAN PATH PROBLEM

A negative example shows that the model given by Mason Iri is used to prove that the relationship between the minimum flow problem and the Hamiltonian path problem in a (directed) network, is not rigorous. A new model called minimum spanning flow in a network is established to revise the old one. It is proved that the problem of determining whether there is a Hamiltonian path from a specified vertex s to another t on a given digraph can be reducible at polynomial time to the problem of constructing a minimum spanning flow in a two-terminal extended network s,t , with the unit capacity for all arcs.

Light-Front Hamiltonian and Path Integral Formulations of the Conformally Gauge-Fixed Polyakov D1 Brane Action

In a recent paper we have studied the Hamiltonian and path integral quantizations of the conformally gauge-fixed Polyakov D1 brane action in the instant-form of dynamics using the equal world-sheet time framework on the hyperplanes defined by the world- sheet time . In the present work we quantize the same theory in the equal light-cone world-sheet time framework, on the hyperplanes of the light-front defined by the light-cone world-sheet time , using the standard constraint quantization techniques in the Hamiltonian and path integral formulations. The light-front theory is seen to be a constrained system in the sense of Dirac, which is in contrast to the corresponding case of the instant-form theory, where the theory remains unconstrained in the sense of Dirac. The light-front theory is seen to possess a set of twenty six primary second-class contraints. In the present work Hamiltonian and path integral quantizations of this theory are studied on the light-front.

Establishing path integral in the entangled state representation for Hamiltonians in quantum optics

Based on two mutually conjugate entangled state representations, we establish the path integral formalism for some Hamiltonians of quantum optics in entangled state representations. The Wigner operator in the entangled state representation is presented. Its advantages are explained.

A SUFFICIENT CONDITION FOR HAMILTONIAN CYCLES IN BIPARTITE TOURNAMENTS

In this paper, we present a new sufficient condition on degrees for a bipartite tournament to be Hamiltonian, that is, if an n × n bipartite tournament T satisfies the condition W（n - 3）, then T is Hamiltonian, except for four exceptional graphs. This result is shown to be best possible in a sense.

ON THE NUMBER OF INCREASING PATHS IN LABELED CYCLES AND STARS

A labeled graph is an ordered pair （G, L） consisting of a graph G and its labeling L ： V（G） → {1,2 ,n}, where n = ｜V（G）｜. An increasing nonconsecutive path in a labeled graph （G,L） is either a path （u1,u2 uk） （k ≥ 2） in G such that L（u,） ＋ 2 ≤ L（ui＋1） for all i = 1, 2, ..., k- 1 or a path of order 1. The total number of increasing nonconsecutive paths in （G, L） is denoted by d（G, L）. A labeling L is optimal if the labeling L produces the largest d（G, L）. In this paper, a method simpler than that in Zverovich （2004） to obtain the optimal labeling of path is given. The optimal labeling of other special graphs such as cycles and stars is obtained.

Hamiltonian Cycles in Regular 2-Connected Claw-Free Graphs

A known result by Jackson Bill is that every 2-connected k-regular graph on at most 3k vertices is Hamiltonian. In this paper,it is proved that every 2-connected k-regular claw-free graph on at most 5k(k≥10)vertices is Hamiltonian. Moreover, the bound 5k is best possible. A counterexample of a 2-connected k-regular claw-free non-Hamiltonian graph on 5k+1 vertices is given, and it is conjectured that every 3-connected k-regular claw-free graph on at most 12k-7 vertices is Hamiltonian.

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 nding the best paths in a network.To nd the path between the source and destination nodes where every node is visited once with no repeats,Hamiltonian and Hypercube routing protocols are often used.Nonetheless,these algorithms are not designed to solve the problem of a node failure,where one or more nodes become faulty.This paper proposes an efcient modied Fault-free Hamiltonian Cycle based on the Hypercube Topology(FHCHT)to perform a connection between nodes when one or more nodes become faulty.FHCHT can be applied in a different environment to transmit data with a high-reliability connection by nding an alternative path between the source and destination nodes when some nodes fail.Moreover,a proposed Hamiltonian Near Cycle(HNC)scheme has been developed and implemented.HNC implementation results indicated that FHCHT produces alternative cycles relatively similar to a Hamiltonian Cycle for the Hypercube,complete,and random graphs.The implementation of the proposed algorithm in a Hypercube achieved a 31%and 76%reduction in cost compared to the complete and random graphs,respectively.

The Number and Distributions of Limit Cycles of a Cubic Hamiltonian System with Z_2-symmetry Perturbation

This paper is concerned with the number and distributions of limit cycles of a cubic Z2-symmetry Hamiltonian system under quintic perturbation.By using qualitative analysis of differential equation,bifurcation theory of dynamical systems and the method of detection function,we obtain that this system exists at least 14 limit cycles with the distribution C91 [C11 ＋ 2（C32 2C12）].

Longest Paths and Cycles in Connected Claw-Free Graphs

A graph is called claw-free if it does not contain a claw as its induced subgraph.In this paper, we prove the following results:1)If G is a 2-connected claw-free graph on n vertices,then for any vertex v and any two distinct vertices x and y in V(G)-{v},G has a path containing v and all neighbors of v and connecting x and y;2) Let C be the longest cycle in a 3-connected claw-free graph G and H a component of G-C,and if H is connected but not 2-connected,then there exist nonadjacent vertices u and v in H such that |V(C)|≥(3(d(u)+)d(v))-2.

Quasi-Kernels for Oriented Paths and Cycles

If D is a digraph, then K∈V(D) is a quasi-kernel of D if D[K]is discrete and for each y∈V(D)-K there is x∈K such that the directed distance from y to x is less than three. We give formulae for the number of quasi-kernels and for the number of minimal quasi-kernels of oriented paths and cycles.

Secure Path Cycle Selection Method Using Fuzzy Logic System for Improving Energy Efficiency in Statistical En-Route Filtering Based WSNs

Sensor nodes are easily compromised to malicious attackers due to an open environment. A false injected attack which takes place on application layer is elected by the compromised node. If the false report arrives in a base station, a false alarm is occurred, and the energy of the nodes is consumed. To detect the false report, statistical en-route filtering method is proposed. In this paper, we proposed the secure path cycle selection method using fuzzy rule-based system to consume effective energy. The method makes balanced energy consumption of each node. Moreover, the lifetime of the whole network will be increased. The base station determines the path cycle using the fuzzy rule-based system. The performance of the proposed method is demonstrated using simulation studies with the three methods.

Instant-Form and Light-Front Hamiltonian and Path Integral Formulations of the Conformally Gauge-Fixed Polyakov D1-Brane Action in the Presence of a Scalar Axion Field and an <i>U</i>(1) Gauge Field

Recently we have studied the instant-form quantization (IFQ) and the light-front quantization (LFQ) of the conformally gauge-fixed Polyakov D1 brane action using the Hamiltonian and path integral formulations. The IFQ is studied in the equal world-sheet time framework on the hyperplanes defined by the world-sheet time σ0=τ=constant and the LFQ in the equal light-cone world-sheet time framework, on the hyperplanes of the light-front defined by the light-cone world-sheet time σ+= (τ+σ) =constant. The light-front theory is seen to be a constrained system in the sense of Dirac in contrast to the instant-form theory. However, owing to the gauge anomalous nature of these theories, both of these theories are seen to lack the usual string gauge symmetries defined by the world-sheet reparametrization invariance (WSRI) and the Weyl invariance (WI). In the present work we show that these theories when considered in the presence of background gauge fields such as the NSNS 2-form gauge field Bαβ(σ,τ) or in the presence of U(1) gauge field Aα(σ,τ) and the constant scalar axion field C(σ,τ), then they are seen to possess the usual string gauge symmetries (WSRI and WI). In fact, these background gauge fields are seen to behave as the Wess-Zumino or Stueckelberg fields and the terms containing these fields are seen to behave as Wess-Zumino or Stueckelberg terms for these theories.

Hamiltonian, Path Integral and BRST Formulations of the Restricted Gauge Theory of <i>QCD₂</i>

We study the Hamiltonian, path integral and Becchi-Rouet-Stora and Tyutin (BRST) formulations of the restricted gauge theory of QCD2 à la Cho et al. under appropriate gauge-fixing conditions.

Light-Front Hamiltonian, Path Integral and BRST Formulations of the Chern-Simons-Higgs Theory in the Broken Symmetry Phase

In the present work we study the Hamiltonian, path integral and BRST formulations of the Chern-Simons-Higgs theory in two-space one-time dimensions, in the so-called broken symmetry phase of the Higgs potential (where the phase φ(xμ) of the complex matter field Φ(xμ) carries the charge degree of freedom of the complex matter field and is akin to the Goldstone boson) on the light-front (i.e., on the hyperplanes defined by the fixed light-cone time). The theory is seen to possess a set of first-class constraints and the local vector gauge symmetry. The theory being gauge-invariant is quantized under appropriate gauge-fixing conditions. The explicit Hamiltonian and path integral quantization is achieved under the above light-cone gauges. The Heisenberg equations of motion of the system are derived for the physical degrees of freedom of the system. Finally the BRST quantization of the system is achieved under appropriate BRST gauge-fixing, where the BRST symmetry is maintained even under the BRST light-cone gauge-fixing.

Implementation Path and Development Trend of Green Buildings Based on Life Cycle Management

In response to the Beautiful China development strategy,in accordance with the"applicable,economical,green and beautiful"architectural policy of the new era,green buildings have been continuously optimized and popularized.Based on the life cycle theory,from the multi-dimensional perspectives of policy,building materials,construction,design,evaluation standards,operation,etc.,this paper studied the implementation path and development trend of green buildings.It discussed the main implementation paths and restrictive factors of green buildings,and provided solutions and development directions.It mainly elaborated the influencing factors and development direction of green buildings,in order to provide a documentary support for the development of green building industry,and provide a certain reference for the ecological civilization construction of beautiful China.