• Journal of the Korean Mathematical Society
• /
• v.50 no.6
• /
• pp.1199-1211
• /
• 2013

We introduce a new class of graphs, called quasi $m$-Cayley graphs, having good symmetry properties, in the sense that they admit a group of automorphisms G that fixes a vertex of the graph and acts semiregularly on the other vertices. We determine when these graphs are strongly regular, and this leads us to define a new algebro-combinatorial structure, called quasi-partial difference family, or QPDF for short. We give several infinite families and sporadic examples of QPDFs. We also study several properties of QPDFs and determine, under several conditions, the form of the parameters of QPDFs when the group G is cyclic.

• International Journal of Computer Science & Network Security
• /
• v.21 no.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.

• Bulletin of the Korean Mathematical Society
• /
• v.38 no.2
• /
• pp.317-324
• /
• 2001

A Cayley graph of a finite group G is called normal edge-transitive if its automorphism group has a subgroup which both normalized G and acts transitively on edges. In this paper, we consider Cayley graphs of finite cyclic groups, namely, finite circulant graphs. We characterize the normal edge-transitive circulant graphs and determine the normal edge-transitive circulant graphs of prime power order in terms of lexicographic products.

• Korean Journal of Mathematics
• /
• v.29 no.4
• /
• pp.741-747
• /
• 2021

The Cayley-Bacharach theorem says that every cubic curve on an algebraically closed field that passes through a given 8 points must contain a fixed ninth point, counting multiplicities. Ren et al. introduced a concrete formula for the ninth point in terms of the 8 points [4]. We would like to consider a different approach to find the ninth point via the theory of truncated moment problems. Various connections between algebraic geometry and truncated moment problems have been discussed recently; thus, the main result of this note aims to observe an interplay between linear algebra, operator theory, and real algebraic geometry.

• Kyungpook Mathematical Journal
• /
• v.28 no.1
• /
• pp.35-38
• /
• 1988

• Journal for History of Mathematics
• /
• v.19 no.2
• /
• pp.125-140
• /
• 2006

In 1933, I. Schur introduced a Schur ring in connection with permutation group and regular subgroup. After then, it was studied mostly for purely group theoretical purposes. In 1970s, Klin and Poschel initiated its usage in the investigation of graphs, especially for Cayley and circulant graphs. Nowadays it is known that Schur ring is one of the best way to enumerate Cayley graphs. In this paper we study the origin of Schur ring back to 1933 and keep trace its evolution to graph theory and combinatorics.

• Journal of the Korean Mathematical Society
• /
• v.30 no.1
• /
• pp.41-49
• /
• 1993

• East Asian mathematical journal
• /
• v.13 no.2
• /
• pp.265-269
• /
• 1997

• Kyungpook Mathematical Journal
• /
• v.4 no.1
• /
• pp.23-47
• /
• 1961

• Journal for History of Mathematics
• /
• v.19 no.1
• /
• pp.33-42
• /
• 2006

In this paper, we study the theoretical and historical backgrounds with respect to isomorphism problem of combinatorial objects which is one of major problems in the theory of Combinatorics. And also, we introduce a partial result for isomorphism problem of Cayley objects over a finite field.