• Journal of Information Processing Systems
• /
• 제7권1호
• /
• pp.75-84
• /
• 2011

The enhanced pyramid graph was recently proposed as an interconnection network model in parallel processing for maximizing regularity in pyramid networks. We prove that there are two edge-disjoint Hamiltonian cycles in the enhanced pyramid networks. This investigation demonstrates its superior property in edge fault tolerance. This result is optimal in the sense that the minimum degree of the graph is only four.

• 정보처리학회논문지A
• /
• 제13A권3호
• /
• pp.253-260
• /
• 2006

본 논문에서는 피라미드 그래프에서의 헤밀톤 사이클 특성을 분석한다. 사이클 확장 연산을 이용하여 사이클의 크기를 확대시켜 나가는 일련의 과정을 통하여 헤밀톤 사이클을 찾을 수 있는 제시된 알고리즘을 적용함으로써 임의의 높이 N인 피라미드 그래프 내에 길이 $(4^N-1)/3$인 헤밀톤 사이클이 존재함을 증명한다.

• Journal of applied mathematics & informatics
• /
• 제42권4호
• /
• pp.761-775
• /
• 2024

A cycle in a graph G that contains all of its vertices is said to be the Hamiltonian cycle of that graph. A Hamiltonian graph is one that has a Hamiltonian cycle. This article discusses how to create a new network from an existing one, such as the Enhanced Honeycomb Network EHC(n), which is created by adding six new edges to each layer of the Honeycomb Network HC(n). Enhanced honeycomb networks have 9n² + 3n - 6 edges and 6n² vertices. For every perfect sub-Honeycombe topology, this new network features six edge disjoint Hamiltonian cycles, which is an advantage over Honeycomb. Its diameter is (2n + 1), which is nearly 50% lesser than that of the Honeycomb network. Using 3-bit grey code, we demonstrated that the Enhanced Honeycomb Network EHC(n) is Hamiltonian.

• 대한수학회지
• /
• 제46권2호
• /
• pp.363-447
• /
• 2009

The author previously defined the spectral invariants, denoted by $\rho(H;\;a)$, of a Hamiltonian function H as the mini-max value of the action functional ${\cal{A}}_H$ over the Novikov Floer cycles in the Floer homology class dual to the quantum cohomology class a. The spectrality axiom of the invariant $\rho(H;\;a)$ states that the mini-max value is a critical value of the action functional ${\cal{A}}_H$. The main purpose of the present paper is to prove this axiom for nondegenerate Hamiltonian functions in irrational symplectic manifolds (M, $\omega$). We also prove that the spectral invariant function ${\rho}_a$ : $H\;{\mapsto}\;\rho(H;\;a)$ can be pushed down to a continuous function defined on the universal (${\acute{e}}tale$) covering space $\widetilde{HAM}$(M, $\omega$) of the group Ham((M, $\omega$) of Hamiltonian diffeomorphisms on general (M, $\omega$). For a certain generic homotopy, which we call a Cerf homotopy ${\cal{H}}\;=\;\{H^s\}_{0{\leq}s{\leq}1}$ of Hamiltonians, the function ${\rho}_a\;{\circ}\;{\cal{H}}$ : $s\;{\mapsto}\;{\rho}(H^s;\;a)$ is piecewise smooth away from a countable subset of [0, 1] for each non-zero quantum cohomology class a. The proof of this nondegenerate spectrality relies on several new ingredients in the chain level Floer theory, which have their own independent interest: a structure theorem on the Cerf bifurcation diagram of the critical values of the action functionals associated to a generic one-parameter family of Hamiltonian functions, a general structure theorem and the handle sliding lemma of Novikov Floer cycles over such a family and a family version of new transversality statements involving the Floer chain map, and many others. We call this chain level Floer theory as a whole the Floer mini-max theory.

• International Journal of Computer Science & Network Security
• /
• 제21권8호
• /
• pp.17-27
• /
• 2021

Non-abelian group based cryptosystems are a latest research inspiration, since they offer better security due to their non-abelian properties. In this paper, we propose a novel approach to non-abelian group based public-key cryptographic protocols using semidirect products of finite groups. An intractable problem of determining automorphisms and generating elements of a group is introduced as the underlying mathematical problem for the suggested protocols. Then, we show that the difficult problem of determining paths and cycles of Cayley graphs including Hamiltonian paths and cycles could be reduced to this intractable problem. The applicability of Hamiltonian paths, and in fact any random path in Cayley graphs in the above cryptographic schemes and an application of the same concept to two previous cryptographic protocols based on a Generalized Discrete Logarithm Problem is discussed. Moreover, an alternative method of improving the security is also presented.

• Journal of applied mathematics & informatics
• /
• 제26권3_4호
• /
• pp.531-540
• /
• 2008

We discuss the decomposition problems on circuit graphs and triangular graphs, and show how they can be applied to obtain results on spanning trees or hamiltonian cycles. We also prove that every circuit graph containing no separating 3-cycles can be extended by adding new edges to a triangular graph containing no separating 3-cycles.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2000년도 추계종합학술대회
• /
• pp.412-418
• /
• 2000

본 논문에서는 HCN(n,n)이 Hamiltonian Cycles을 갖는다는 것을 증명하고, HCN(n,n)과 HFN(n,n) 사이의 임베딩을 분석하고, HFN(n,n)과 2n-hypercube사이의 임베딩을 분석한다. HCN(n,n)을 HFN(n,n)에 연장율 3에 임베딩 가능함을 증명하고, HFN(n,n)을 HCN(n,n)에 임베딩하는 비용이 O(n)임을 증명하며, HFN(n,n)을 2n-hypercube애 연장율 3에 임베딩 가능함을 증명하고, 2n-hypercube을 HFN(n,n)에 임베딩하는 비용이 O(n)임을 증명한다

• Journal of Information Processing Systems
• /
• 제13권6호
• /
• pp.1554-1574
• /
• 2017

This paper introduces a new type of determining factor for Pseudo Random Strings (PRS). This classification depends upon a mathematical property called Finite Induction (FI). FI is similar to a Markov Model in that it presents a model of the sequence under consideration and determines the generating rules for this sequence. If these rules obey certain criteria, then we call the sequence generating these rules FI a PRS. We also consider the relationship of these kinds of PRS's to Good/deBruijn graphs and Linear Feedback Shift Registers (LFSR). We show that binary sequences from these special graphs have the FI property. We also show how such FI PRS's can be generated without consideration of the Hamiltonian cycles of the Good/deBruijn graphs. The FI PRS's also have maximum Shannon entropy, while sequences from LFSR's do not, nor are such sequences FI random.

• 대한수학회지
• /
• 제51권6호
• /
• pp.1141-1154
• /
• 2014

A k-hypertournament H on n vertices, where $2{\leq}k{\leq}n$, is a pair H = (V,A), where V is the vertex set of H and A is a set of k-tuples of vertices, called arcs, such that for all subsets $S{\subseteq}V$ with |S| = k, A contains exactly one permutation of S as an arc. Recently, Li et al. showed that any strong k-hypertournament H on n vertices, where $3{\leq}k{\leq}n-2$, is vertex-pancyclic, an extension of Moon's theorem for tournaments. In this paper, we prove the following generalization of another of Moon's theorems: If H is a strong k-hypertournament on n vertices, where $3{\leq}k{\leq}n-2$, and C is a Hamiltonian cycle in H, then C contains at least three pancyclic arcs.

• 정보처리학회논문지C
• /
• 제12C권1호
• /
• pp.77-82
• /
• 2005

광 네트워크에서의 효율성과 안정성을 위해 보호 복구가 요구되면서 기존의 여러 보호 복구 방법들이 제안되고 있으며, 많은 연구가 진행되고 있다. 기존 연구 중에서 네트워크 토폴로지를 하나의 사이클로 구성하여 어느 한 링크가 손상되더라도 복구가 가능한 방법들이 제시되고 있다. 본 논문에서는 해밀턴 사이클(Hamiltonian cycle)을 이용하여 네트워크 토폴로지를 하나의 사이클이 아닌 몇 개의 다중 도메인으로 분리하여 장애 발생 시 해당 도메인 내에서 복구경로 설정이 가능한 알고리즘을 제안한다. 제안된 알고리즘을 시뮬레이션을 통해 분석한 결과 복구경로길이가 단일 사이클의 경우에 비해 $57{\%}$ 이상 감소함을 볼 수 있다. 즉, 다중 도메인으로 분리, 보호복구를 수행 할 경우 복구 용량의 증가는 크지 않으면서 고속 복구가 가능함을 확인할 수 있다.