• Journal of the Chungcheong Mathematical Society
• /
• v.25 no.4
• /
• pp.633-642
• /
• 2012

We give the complete classification of binary formally self-dual even codes of length 18. There are exactly 26568 inequivalent such codes. This completes the classification of binary formally self-dual even codes of length up to 18.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.3
• /
• pp.159-166
• /
• 2017

This paper proposes an algorithm for odd, doubly even, and singly even magic squares. In constructing an odd magic square, de la $Loub{\grave{e}}re^{\prime}s$ method is widely known and used, but it has an inherent defect of executing $O(n^2)$ steps. 2 types of cross algorithms have been proposed to the double even magic square, and more to the singly even magic square based on the odd magic square of ${\frac{n}{2}}{\times}{\frac{n}{2}}$, the most popular and simple of which is one proposed by Strachey. The algorithm proposed in this paper successfully constructs odd and doubly even magic squares by undergoing 3 steps and 4 steps respectively. It also directly constructs a singly even magic square without having its basis on the odd magic square.

• Journal of the Korean Mathematical Society
• /
• v.59 no.4
• /
• pp.757-774
• /
• 2022

Let a and b be positive even integers. An even [a, b]-factor of a graph G is a spanning subgraph H such that for every vertex v ∈ V (G), d_H(v) is even and a ≤ dH(v) ≤ b. Let κ(G) be the minimum size of a vertex set S such that G - S is disconnected or one vertex, and let σ₂(G) = min_uv∉E(G) (d(u)+d(v)). In 2005, Matsuda proved an Ore-type condition for an n-vertex graph satisfying certain properties to guarantee the existence of an even [2, b]-factor. In this paper, we prove that for an even positive integer b with b ≥ 6, if G is an n-vertex graph such that n ≥ b + 5, κ(G) ≥ 4, and σ₂(G) ≥ ${\frac{8n}{b+4}}$, then G contains an even [4, b]-factor; each condition on n, κ(G), and σ₂(G) is sharp.

• IE interfaces
• /
• v.15 no.3
• /
• pp.279-285
• /
• 2002

A break-even analysis is a method used widely for profit planning or decisions in most companies. It is useful tool in financial studies because it is simple and offers useful insights from a modest amount of data. Although it is widely used, it has some weaknesses. It is limited in particular to the analysis for a short term time horizon or one period. We suggest a new break-even procedure to analyze projects with a long term time horizon as keeping the simplicity of a conventional break-even analysis. We will make efforts doing to include actual data for a cost or an income as much as possible rather than developing a mathematical model to improve unreality of a traditional break-even analysis. Also, we will use the spreadsheet software to solve problems.

• Journal of applied mathematics & informatics
• /
• v.30 no.5_6
• /
• pp.913-923
• /
• 2012

The Odd-Even graceful labeling of a graph G with $q$ edges means that there is an injection $f:V (G)$ to $\{1,3,5,{\cdots},2q+1\}$ such that, when each edge $uv$ is assigned the label ${\mid}f(u)-f(v){\mid}$, the resulting edge labels are $\{2,4,6,{\cdots},2q\}$. A graph which admits an odd-even graceful labeling is called an odd-even graceful graph. In this paper, we prove that some well known graphs namely $P_n$, $P_n^+$, $K_{1,n}$, $K_{1,2,n}$, $K_{m,n}$, $B_{m,n}$ are Odd-Even graceful.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.9_10
• /
• pp.421-428
• /
• 2008

A. Ghafoor proposed Even networks as a class of fault-tolerant multiprocessor networks in [1] and analyzed so many useful properties include node disjoint paths. By introducing node disjoint paths in [1], fault diameter of Even networks is d+2(d=odd) and d+3(d=even). But the lengths of node disjoint paths proved in [1] are not the shortest. In this paper, we show that Even network Ed is node symmetric. We also propose the shortest lengths of node disjoint paths using cyclic permutation, and fault diameter of Even networks is d+1.

• Bulletin of the Korean Mathematical Society
• /
• v.58 no.1
• /
• pp.31-46
• /
• 2021

Let a and b be positive integers, and let V (G), ��(G), and ��2(G) be the vertex set of a graph G, the minimum degree of G, and the minimum degree sum of two non-adjacent vertices in V (G), respectively. An even [a, b]-factor of a graph G is a spanning subgraph H such that for every vertex v ∈ V (G), dH(v) is even and a ≤ dH(v) ≤ b, where dH(v) is the degree of v in H. Matsuda conjectured that if G is an n-vertex 2-edge-connected graph such that $n{\geq}2a+b+{\frac{a^2-3a}{b}}-2$, ��(G) ≥ a, and ${\sigma}_2(G){\geq}{\frac{2an}{a+b}}$, then G has an even [a, b]-factor. In this paper, we provide counterexamples, which are highly connected. Furthermore, we give sharp sufficient conditions for a graph to have an even [a, b]-factor. For even an, we conjecture a lower bound for the largest eigenvalue in an n-vertex graph to have an [a, b]-factor.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.495-498
• /
• 1999

In this paper, we propose the adaptive Odd/Even Multi-shell Median Filter(adaptive O/E MMF) to improve the defect that Modified Multi-shell Median Filter(MMMF) can not recover missing lines of vertical and cross direction. This filter uses odd/even multi-shells and new proposed threshold strategy The performance of the proposed filter is evaluated over image 'airfield 'by using MATLAB. As the proposed threshold strategy eliminate the number of redundant replacement, it suppresses impulse noise and recovers missing lines.

• Journal of the Korean Mathematical Society
• /
• v.44 no.3
• /
• pp.697-706
• /
• 2007

In [8], we showed that any ideal of $\mathbb{Z}_4[X]/(X^{2^n}-1)$ is generated by at most two polynomials of the standard forms. The purpose of this paper is to find a description of the cyclic codes of even length over $\mathbb{Z}_4$ namely the ideals of $\mathbb{Z}_4[X]/(X^l\;-\;1)$, where $l$ is an even integer.

• Journal of the Chungcheong Mathematical Society
• /
• v.35 no.1
• /
• pp.1-12
• /
• 2022

In this paper we prove an even characteristic analogue of the result of Andrade on lower bounds for moment of quadratic Dirichlet L-functions in odd characteristic. We establish lower bounds for the moments of Dirichlet L-functions of characters defined by Hasse symbols in even characteristic.