• ETRI Journal
• /
• v.20 no.4
• /
• pp.327-345
• /
• 1998

This paper deals with the problem of one-to-one mapping of 2$^n$ task modules of a parallel program to an n-dimensional hypercube multicomputer so as to minimize the total communication cost during the execution of the task. The problem of finding an optimal mapping has been proven to be NP-complete. First we show that the mapping problem in a hypercube multicomputer can be transformed into the problem of finding a set of maximum cutsets on a given task graph using a graph modification technique. Then we propose a repeated mapping scheme, using an existing graph bipartitioning algorithm, for the effective mapping of task modules onto the processors of a hypercube multicomputer. The repeated mapping scheme is shown to be highly effective on a number of test task graphs; it increasingly outperforms the greedy and recursive mapping algorithms as the number of processors increases. Our repeated mapping scheme is shown to be very effective for regular graphs, such as hypercube-isomorphic or 'almost' isomorphic graphs and meshes; it finds optimal mappings on almost all the regular task graphs considered.

• Honam Mathematical Journal
• /
• v.41 no.1
• /
• pp.67-87
• /
• 2019

The main aim of this study is to characterize new classes of multicone graphs which are determined by their adjacency spectra, their Laplacian spectra, their complement with respect to signless Laplacian spectra and their complement with respect to their adjacency spectra. A multicone graph is defined to be the join of a clique and a regular graph. If n is a positive integer, a friendship graph $F_n$ consists of n edge-disjoint triangles that all of them meet in one vertex. It is proved that any connected graph cospectral to a multicone graph $F_n{\nabla}F_n=K_2{\nabla}nK_2{\nabla}nK_2$ is determined by its adjacency spectra as well as its Laplacian spectra. In addition, we show that if $n{\neq}2$, the complement of these graphs are determined by their adjacency spectra. At the end of the paper, it is proved that multicone graphs $F_n{\nabla}F_n=K_2{\nabla}nK_2{\nabla}nK_2$ are determined by their signless Laplacian spectra and also we prove that any graph cospectral to one of multicone graphs $F_n{\nabla}F_n$ is perfect.

• ETRI Journal
• /
• v.29 no.3
• /
• pp.381-389
• /
• 2007

In this paper we propose a graph-theoretic method based on linear congruence for constructing low-density parity check (LDPC) codes. In this method, we design a connection graph with three kinds of special paths to ensure that the Tanner graph of the parity check matrix mapped from the connection graph is without short cycles. The new construction method results in a class of (3, ${\rho}$)-regular quasi-cyclic LDPC codes with a girth of 12. Based on the structure of the parity check matrix, the lower bound on the minimum distance of the codes is found. The simulation studies of several proposed LDPC codes demonstrate powerful bit-error-rate performance with iterative decoding in additive white Gaussian noise channels.

• The KIPS Transactions:PartA
• /
• v.11A no.5
• /
• pp.341-346
• /
• 2004

Recently A Hyper-Star Graph HS(m, k) has been introduced as a new interconnection network of new topology for parallel processing. Hyper-Star Graph has properties of hypercube and star graph, further improve the network cost of a hypercube with the same number of nodes. In this paper, we show that Hyper-Star Graph HS(m, k) is subgraph of hypercube. And we also show that regular graph, Hyper-Star Graph HS(2n, n) is node-symmetric by introduced mapping algorithm. In addition, we introduce an efficient one-to-all broadcasting scheme - takes 2n-1 times - in Hyper-Star Graph HS(2n, n) based on a spanning tree with minimum height.

• 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.6
• /
• pp.1629-1643
• /
• 2016

Let R be a ring with identity, X be the set of all nonzero, nonunits of R and G be the group of all units of R. A ring R is called unit-duo ring if $[x]_{\ell}=[x]_r$ for all $x{\in}X$ where $[x]_{\ell}=\{ux{\mid}u{\in}G\}$ (resp. $[x]_r=\{xu{\mid}u{\in}G\}$) which are equivalence classes on X. It is shown that for a semisimple unit-duo ring R (for example, a strongly regular ring), there exist a finite number of equivalence classes on X if and only if R is artinian. By considering the zero divisor graph (denoted ${\tilde{\Gamma}}(R)$) determined by equivalence classes of zero divisors of a unit-duo ring R, it is shown that for a unit-duo ring R such that ${\tilde{\Gamma}}(R)$ is a finite graph, R is local if and only if diam(${\tilde{\Gamma}}(R)$) = 2.

• Communications of the Korean Mathematical Society
• /
• v.20 no.3
• /
• pp.521-529
• /
• 2005

We prove that the dimension of the space of positive (bounded, respectively) solutions for the Schrodinger operator whose potential q is nonnegative on a graph with q-regular ends is equal to the number of ends (q-nonparabolic ends, respectively).

• Journal of applied mathematics & informatics
• /
• v.22 no.1_2
• /
• pp.21-38
• /
• 2006

Programmed grammars, one of the most important and well investigated classes of grammars with context-free rules and a mechanism controlling the application of the rules, can be described by graphs. We investigate whether or not the restriction to special classes of graphs restricts the generative power of programmed grammars with erasing rules and without appearance checking, too. We obtain that Eulerian, Hamiltonian, planar and bipartite graphs and regular graphs of degree at least three are pr-universal in that sense that any language which can be generated by programmed grammars (with erasing rules and without appearance checking) can be obtained by programmed grammars where the underlying graph belongs to the given special class of graphs, whereas complete graphs, regular graphs of degree 2 and backbone graphs lead to proper subfamilies of the family of programmed languages.

• Bulletin of the Korean Mathematical Society
• /
• v.42 no.2
• /
• pp.421-432
• /
• 2005

Suppose that an infinite graph G of bounded degree has finite number of ends, each of which is p-regular, where $1. Then we can identify all the positive (bounded, respectively) p-harmonic functions on G.

• 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.