Among graphene-like family, phosphorene is a typical semiconducting layered material, which can also be a superconductor in low temperature. Applying pressure or tension on phosphorene lattice results in changing the hopping terms, which change the energy bands of the material. In this research we use the tight-binding Hamiltonian, including relevant hopping terms, to calculate energy bands of ...

The moment map is a mathematical expression of the concept of the conservation associated with the symmetries of a Hamiltonian system. The abstract moment map is defined from G-manifold M to dual Lie algebra of G. We will interested study maps from G-manifold M to spaces that are more general than dual Lie algebra of G. These maps help us to reduce the dimension of a manifold much more.

For each fixed pair α, c > 0 let INDEPENDENT SET (m ≤ cn) and INDEPENDENT SET (m ≥ n2 ) − cn) be the problem INDEPENDENT SET restricted to graphs on n vertices with m ≤ cn or m ≥ n2 )− cn edges, respectively. Analogously, HAMILTONIAN CIRCUIT (m ≤ n + cn) and HAMILTONIAN PATH (m ≤ n + cn) are the problems HAMILTONIAN CIRCUIT and HAMILTONIAN PATH restricted to graphs with m ≤ n + cn edges. For ea...

It is important for a network to tolerate as many faults as possible. With the graph representation of an interconnection network, a k-regular hamiltonian and hamiltonian connected network is super fault-tolerant hamiltonian if it remains hamiltonian after removing up to k 2 vertices and/or edges and remains hamiltonian connected after removing up to k 3 vertices and/or edges. Super fault-toler...

We study Hamiltonian unfolding—cutting a convex polyhedron along a Hamiltonian path of edges to unfold it without overlap—of two classes of polyhedra. Such unfoldings could be implemented by a single zipper, so they are also known as zipper edge unfoldings. First we consider domes, which are simple convex polyhedra. We find a family of domes whose graphs are Hamiltonian, yet any Hamiltonian unf...

For the interconnection network topology, it is usually represented by a graph. When a network is used, processors and/or links faults may happen. Thus, it is meaningful to consider faulty networks. We consider k-regular graphs in this paper. We define a k-regular hamiltonian and hamiltonian connected graph G is super fault-tolerant hamiltonian if G remains hamiltonian after removing at most k ...

In this paper we consider the relation between symmetries and first integrals for both continuous canonical Hamiltonian equations and discrete Hamiltonian equations. We observe that canonical Hamiltonian equations can be obtained by variational principle from an action functional and consider invariance properties of this functional as it is done in Lagrangian formalism. We rewrite the well–kno...