• Bulletin of the Korean Mathematical Society
• /
• v.52 no.4
• /
• pp.1169-1183
• /
• 2015

We describe generalized Cayley graphs of rectangular groups, so that we obtain (1) an equivalent condition for two Cayley graphs of a rectangular group to be isomorphic to each other, (2) a necessary and sufficient condition for a generalized Cayley graph of a rectangular group to be (strong) connected, (3) a necessary and sufficient condition for the colour-preserving automorphism group of such a graph to be vertex-transitive, and (4) a sufficient condition for the automorphism group of such a graph to be vertex-transitive.

• Journal of applied mathematics & informatics
• /
• v.40 no.3_4
• /
• pp.795-805
• /
• 2022

The aim of author's in this paper is to study the Cayley graph in the realm of signed graph. Moreover, we have characterized generating sets and finite abelian groups that corresponds to balanced Cayley signed graphs. The notion of Cayley signed graph has been demonstrated with the ample number of examples.

• Nonlinear Functional Analysis and Applications
• /
• v.28 no.1
• /
• pp.265-286
• /
• 2023

In this paper, we introduce and study a generalized Cayley operator associated to H(·, ·)-monotone operator in semi-inner product spaces. Using the notion of graph convergence, we give the equivalence result between graph convergence and convergence of generalized Cayley operator for the H(·, ·)-monotone operator without using the convergence of the associated resolvent operator. To support our claim, we construct a numerical example. As an application, we consider a system of generalized Cayley inclusions involving H(·, ·)-monotone operators and give the existence and uniqueness of the solution for this system. Finally, we propose a perturbed iterative algorithm for finding the approximate solution and discuss the convergence of iterative sequences generated by the perturbed iterative algorithm.

• Journal of applied mathematics & informatics
• /
• v.35 no.1_2
• /
• pp.83-93
• /
• 2017

The Cayley graph ${\Gamma}=Cay(G,S)$ is called normal edge-transitive if $N_A(R(G))$ acts transitively on the set of edges of ${\Gamma}$, where $A=Aut({\Gamma})$ and R(G) is the regular subgroup of A. In this paper, we determine all hexavalent normal edge-transitive Cayley graphs on groups of order pqr, where p > q > r > 2 are prime numbers.

• Journal of the Korean Mathematical Society
• /
• v.34 no.2
• /
• pp.337-344
• /
• 1997

In this paper, we study the isomorphism problem of Cayley permutation graphs. We obtain a necessary and sufficient condition that two Cayley permutation graphs are isomrphic by a direction-preserving and color-preserving (positive/negative) natural isomorphism. The result says that if a graph G is the Cayley graph for a group $\Gamma$ then the number of direction-preserving and color-preserving positive natural isomorphism classes of Cayley permutation graphs of G is the number of double cosets of $\Gamma^\ell$ in $S_\Gamma$, where $S_\Gamma$ is the group of permutations on the elements of $\Gamma and \Gamma^\ell$ is the group of left translations by the elements of $\Gamma$. We obtain the number of the isomorphism classes by counting the double cosets.

• Bulletin of the Korean Mathematical Society
• /
• v.61 no.1
• /
• pp.13-27
• /
• 2024

A regular t-balanced Cayley map on a group Γ is an embedding of a Cayley graph on Γ into a surface with certain special symmetric properties. We completely classify regular t-balanced Cayley maps for a class of split metacyclic 2-groups.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.4
• /
• pp.1017-1031
• /
• 2016

Let R be a commutative ring with the non-zero identity and n be a natural number. ${\Gamma}^n_R$ is a simple graph with $R^n{\setminus}\{0\}$ as the vertex set and two distinct vertices X and Y in $R^n$ are adjacent if and only if there exists an $n{\times}n$ lower triangular matrix A over R whose entries on the main diagonal are non-zero such that $AX^t=Y^t$ or $AY^t=X^t$, where, for a matrix B, $B^t$ is the matrix transpose of B. ${\Gamma}^n_R$ is a generalization of Cayley graph. Let $T_n(R)$ denote the $n{\times}n$ upper triangular matrix ring over R. In this paper, for an arbitrary ring R, we investigate the properties of the graph ${\Gamma}^n_{T_n(R)}$.

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.2
• /
• pp.409-419
• /
• 2015

The concept of Cayley-symmetric semigroups is introduced, and several equivalent conditions of a Cayley-symmetric semigroup are given so that an open problem proposed by Zhu [19] is resolved generally. Furthermore, it is proved that a strong semilattice of self-decomposable semigroups $S_{\alpha}$ is Cayley-symmetric if and only if each $S_{\alpha}$ is Cayley-symmetric. This enables us to present more Cayley-symmetric semi-groups, which would be non-regular. This result extends the main result of Wang [14], which stated that a regular semigroup is Cayley-symmetric if and only if it is a Clifford semigroup. In addition, we discuss Cayley-symmetry of Rees matrix semigroups over a semigroup or over a 0-semigroup.

• Bulletin of the Korean Mathematical Society
• /
• v.47 no.1
• /
• pp.17-27
• /
• 2010

A Cayley map is a 2-cell embedding of a Cayley graph into an orientable surface with the same local orientation induced by a cyclic permutation of generators at each vertex. In this paper, we provide classifications of prime-valent regular Cayley maps on abelian groups, dihedral groups and dicyclic groups. Consequently, we show that all prime-valent regular Cayley maps on dihedral groups are balanced and all prime-valent regular Cayley maps on abelian groups are either balanced or anti-balanced. Furthermore, we prove that there is no prime-valent regular Cayley map on any dicyclic group.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.4
• /
• pp.1197-1211
• /
• 2016

Let R be a finite commutative ring with nonzero identity. We define ${\Gamma}(R)$ to be the graph with vertex set R in which two distinct vertices x and y are adjacent if and only if there exists a unit element u of R such that x + uy is a unit of R. This graph provides a refinement of the unit and unitary Cayley graphs. In this paper, basic properties of ${\Gamma}(R)$ are obtained and the vertex connectivity and the edge connectivity of ${\Gamma}(R)$ are given. Finally, by a constructive way, we determine when the graph ${\Gamma}(R)$ is Hamiltonian. As a consequence, we show that ${\Gamma}(R)$ has a perfect matching if and only if ${\mid}R{\mid}$ is an even number.