• Kyungpook Mathematical Journal
• /
• v.47 no.2
• /
• pp.165-714
• /
• 2007

The basis number of a graph G is the least positive integer $k$ such that G has a $k$-fold basis. In this paper, we prove that the basis number of the cartesian product of a path with a circular ladder, a M$\ddot{o}$bius ladder and path with a net is exactly 3. This improves the upper bound of the basis number of these graphs for a general theorem on the cartesian product of graphs obtained by Ali and Marougi, see [2]. Also, by this general result, the cartesian product of a theta graph with a M$\ddot{o}$bius ladder is at most 5. But in section 3 we prove that it is at most 4.

• School Mathematics
• /
• v.9 no.1
• /
• pp.13-28
• /
• 2007

Division of fractions can be categorized as measurement division, partitive or sharing division, the inverse of multiplication, and the inverse of Cartesian product. Division algorithm for fractions has been interpreted with manipulative aids or models mainly in the contexts of measurement division and partitive division. On the contrary, there are few interpretations for the context of the inverse of a Cartesian product. In this paper the significance and the limits of existing interpretations of division of fractions in the context of the inverse of a Cartesian product were discussed. And some new easier interpretations of division algorithm in the context of a Cartesian product are developed. The problem to determine the length of a rectangle where the area and the width of it are known can be solved by various approaches: making the width of a rectangle be equal to one, making the width of a rectangle be equal to some natural number, making the area of a rectangle be equal to 1. These approaches may help students to understand the meaning of division of fractions and the meaning of the inverse of the divisor. These approaches make the inverse of a Cartesian product have many merits as an introductory context of division algorithm for fractions.

• Journal of the Korean Mathematical Society
• /
• v.33 no.1
• /
• pp.15-23
• /
• 1996

Let C be a category of (pointed) spaces. For $X, Y \in C$ we denote the wedge (or one point union) by $X \vee Y$ and the cartesian product by $X \times Y$. Let $Z \in C$; we say that Z cancels with respect to wedge (resp. cartesian product) and C, if for all $X, Y \in C$ the existence of a homotopy equivalence $X \vee Z \to Y \vee Z$ implies the existence of a homotopy equivalence $X \to Y$ (resp. for cartesian product). If this does not hold, we say that there is a non-cancellation phenomenon involving Z (and C).

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.10a
• /
• pp.910-913
• /
• 2015

자바스크립트는 웹 페이지를 제어하기 위한 표준적인 스크립트 언어로 오랫동안 사용되어 왔다. 최근 웹 앱이나 서버사이드 응용 프로그램을 자바스크립트로 작성하게 되면서, 자바스크립트 프로그램을 더욱 빠르게 동작하도록 만드는 것이 중요한 이슈가 되었다. 본 논문에서는 암시적인 동적 타입 시스템을 사용하는 자바스크립트 언어에 Cartesian Product Algorithm을 적용하여 타입을 추론하고, 이 정보를 바탕으로 정적 타입 시스템인 C++ 코드로 변환하는 컴파일러의 구조와 알고리즘을 제시한다.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.05a
• /
• pp.18-21
• /
• 2003

We propose some properties of fuzzy conditional expectation of hybrid number the addition of fuzzy number and random variable using Cartesian product distance for ${\alpha}$-level sets.

• Communications of the Korean Mathematical Society
• /
• v.37 no.4
• /
• pp.1073-1097
• /
• 2022

In this paper, we shall be concerned with evaluation of multifractal Hausdorff measure 𝓗^q,t_𝜇 and multifractal packing measure 𝓟^q,t_𝜇 of Cartesian product sets by means of the measure of their components. This is done by investigating the density result introduced in [34]. As a consequence, we get the inequalities related to the multifractal dimension functions, proved in [35], by using a unified method for all the inequalities. Finally, we discuss the extension of our approach to studying the multifractal Hewitt-Stromberg measures of Cartesian product sets.

• Journal of applied mathematics & informatics
• /
• v.40 no.1_2
• /
• pp.117-132
• /
• 2022

Reverse edge magic(REM) labeling of the graph G = (V, E) is a bijection of vertices and edges to a set of numbers from the set, defined by λ : V ∪ E → {1, 2, 3, …, |V| + |E|} with the property that for every xy ∈ E, constant k is the weight of equals to a xy, that is λ(xy) - [λ(x) + λ(x)] = k for some integer k. We given the construction of REM labeling for the Cartesian Product, Unions of Braids and Unions of Triangular Belts. The Kotzig array used in this paper is the 3 × (2r + 1) kotzig array. we test the konow results about REM labelling that are related to the new results we found.

• Journal of applied mathematics & informatics
• /
• v.33 no.5_6
• /
• pp.545-557
• /
• 2015

A vague graph is a generalized structure of a fuzzy graph that gives more precision, flexibility and compatibility to a system when compared with systems that are designed using fuzzy graphs. In this paper, we define two new operation on vague graphs namely normal product and tensor product and study about the degree of a vertex in vague graphs which are obtained from two given vague graphs G₁ and G₂ using the operations cartesian product, composition, tensor product and normal product. These operations are highly utilized by computer science, geometry, algebra, number theory and operation research. In addition to the existing operations these properties will also be helpful to study large vague graph as a combination of small, vague graphs and to derive its properties from those of the smaller ones.

• Bulletin of the Korean Mathematical Society
• /
• v.47 no.6
• /
• pp.1155-1162
• /
• 2010

In this paper, we find the maximum exponent of D ${\times}$ E, the cartesian product of two digraphs D and E on n, n + 2 vertices, respectively for an even integer $n\geq4$. We also characterize the extrema cases.

• Korean Journal of Mathematics
• /
• v.21 no.2
• /
• pp.151-159
• /
• 2013

An $L(j,k)$-labeling of a graph G is a vertex labeling such that the difference of the labels of any adjacent vertices is at least $j$ and that of any vertices of distance two is at least $k$ for given $j$ and $k$. The minimum span of all L(2, 1)-labelings of G is called the ${\lambda}$-number of G and is denoted by ${\lambda}(G)$. In this paper, we find a lower bound of the ${\lambda}$-number of the Cartesian product $K_m{\Box}C_n$ of the complete graph $K_m$ of order $m$ and the cycle $C_n$ of order $n$. In fact, we show that when $n{\geq}3$, ${\lambda}(K_4{\Box}C_n){\geq}7$ and the equality holds if and only if n is a multiple of 8. Moreover when $m{\geq}5$, ${\lambda}(K_m{\Box}C_n){\geq}2m-1$ and the equality holds if and only if $n$ is even.