• 대한수학회지
• /
• 제49권3호
• /
• pp.475-491
• /
• 2012

In 1950 a class of generalized Petersen graphs was introduced by Coxeter and around 1970 popularized by Frucht, Graver and Watkins. The family of $I$-graphs mentioned in 1988 by Bouwer et al. represents a slight further albeit important generalization of the renowned Petersen graph. We show that each $I$-graph $I(n,j,k)$ admits a unit-distance representation in the Euclidean plane. This implies that each generalized Petersen graph admits a unit-distance representation in the Euclidean plane. In particular, we show that every $I$-graph $I(n,j,k)$ has an isomorphic $I$-graph that admits a unit-distance representation in the Euclidean plane with a $n$-fold rotational symmetry, with the exception of the families $I(n,j,j)$ and $I(12m,m,5m)$, $m{\geq}1$. We also provide unit-distance representations for these graphs.

• 한국농공학회지
• /
• 제28권1호
• /
• pp.33-40
• /
• 1986

Unit-graph model to estimate the daily streamfiow was developed on the basis of distribution graph method. The results of evaluating the application of the model to Nakdong watersheds were generally satisfactory and this model would be the groundwork of the "Unit-graph model for daily streamflow in Korean watersheds".eds".uot;.

• Korean Journal of Mathematics
• /
• 제30권1호
• /
• pp.53-60
• /
• 2022

Let R be a finite commutative ring with non zero identity. The unit graph of R denoted by G(R) is the graph obtained by setting all the elements of R to be the vertices of a graph and two distinct vertices x and y are adjacent if and only if x + y ∈ U(R), where U(R) denotes the set of units of R. In this paper, we find the commutative rings R for which G(R) is a line graph. Also, we find the rings for which the complements of unit graphs are line graphs.

• 대한수학회보
• /
• 제53권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.

• Environmental Sciences Bulletin of The Korean Environmental Sciences Society
• /
• 제2권1호
• /
• pp.29-36
• /
• 1998

An instantaneous unit sediment graph (IUSG) model is investigated for prediction of sediment yield from an upland watershed in Northwestern Mississippi. Sediment yields are predicted by convolving source runoff with an IUSG. The IUSG is the distribution of sediment from an instantaneous burst of rainfall producing one unit of runoff. The IUSG, defined as a product of the sediment concentration distribution (SCD) and the instantaneous unit hydrograph (IUH), is known to depend on the characteristics of the effective rainfall. The IUH is derived by the Nash model for each event. The SCD is assumed to be an exponential function for each event and its parameters were correlated with the effective rainfall characteristics. A sediment routing function, based on travel time and sediment particle size, is used to predict the SCD.

• 한국환경과학회지
• /
• 제2권1호
• /
• pp.29-36
• /
• 1993

An instantaneous unit sediment graph (IUSG) model is investigated for prediction of sediment yield from an upland watershed In Northwestern Mississippi. Sediment yields are predicted by convolving source runoff with an IUSG. The IUSG is the distribution of sediment from an instantaneous burst of rainfall producing one unit of runoff. The IUSG, defined as a product of the sediment concentration distribution (SCD) and the instantaneous unit hydrograph (IUH), is known to depend on the characteristics of the effective rainfall. The IUH is derived by the Nash model for each event. The SCD is assumed to be an exponential function for each event and its parameters were correlated with the effective rainfall characteristics. A sediment routing function, based on travel time and sediment particle size, is used to predict the SCD.

• 한국주거학회논문집
• /
• 제19권2호
• /
• pp.43-54
• /
• 2008

The aim of the research is to find out the direction of unit-plans in multi-dwellings for the future society. Shinonome Canal Court where residents actually live now are the objects in this study, and the residential floor plan of unit-plans were analyzed to find out the typical types. The analysis was focused on the unit-plans of 5 blocks of Shinonome Canal Court. Space Syntax Theory was used as the analysis method. As the first stage of the analysis, justified graphs were made to find out the characters of unit-plans through the classification of the graphs. Contents of the analysis are as follows: Relationship between classified justified graphs and dimension according to node number. Relationship between classified justified graph patterns and unit-plans. Characters of unit-plans in each blocks. Shinonome Canal Court consists of mainly small scale unit-plans and 30unit-plans are classified. 1LDK, 2LDK, 1LDK+S, 1LDK+f are typical unit-plans which are mainly supplied in the complex. It is noted that the results of the analysis by node, justified graph pattern and dimension are the same. It also presents diverse unit-plans which shows a change in nLDK pattern or add f (foyer), AN (annex), S (service room), Fs (free space) to basic nLDK type. In summary, it demonstrates the possibility of creating new residental floor plans in multi-dwellings.

• 대한수학회보
• /
• 제53권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.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -2
• /
• pp.959-962
• /
• 2002

This paper presents a method of constructing the universal multiple processing element unit(UMPEU) based on De Bruijn Graph. The proposed method is as following. Firstly we propose transformation operators in order to construct the De Bruijn graph using properties of graph. Secondly we construct the transformation table of De Bruijn graph using above transformation operators. Finally we construct the De Bruijn graph using transformation table. The proposed UMPEU is capable of constructing the De Bruijn geraph for any prime number and integer value of finite fields. Also the UMPEU is applied to fault-tolerant computing system, pipeline class, parallel processing network, switching function and its circuits.

• 한국정보통신학회논문지
• /
• 제21권11호
• /
• pp.2103-2108
• /
• 2017

m차원 평면 $R^m$ 상에 n개의 점들 $p_i$가 주어질 때, 범위 r에 대해서, 점 $p_i$로부터 거리 r이내 점들의 집합 $T_i$를 생각한다. m=1 일 때, $T_i$는 직선상의 구간이고, m=2일 때, $T_i$는 평면상의 원에 해당된다. 집합 $T_i$들을 정점에 대응하고, 두 집합이 교차하는 경우에 대응하는 두 정점 사이에 간선를 연결하면 교차 그래프 G를 얻을 수 있다. m=1일 때, G는 진구간 그래프(proper interval graph), m=2일 때, G는 단위 원판 그래프(unit disk graph)라고 부른다. 본 논문에서는 범위 r이 변화하면 바뀌는 교차 그래프 G(r)에 관심이 있다. 특별히 G(r)가 연결 그래프가 되는 최소 r을 찾는 문제를 다룰 것이다. 이 문제에 대해서 진구간 그래프 G(r)에 대해서 O(n)시간 알고리즘, 단위 원판 그래프 G(r)에 대해서 $O(n^2{\log}\;n)$시간 알고리즘을 제안한다. 직선상의 점들이 추가 되거나 삭제되는 동적 환경 하에서 위 문제를 O(lon n)시간에 해결하는 알고리즘도 제안한다.