• Communications of the Korean Mathematical Society
• /
• v.30 no.2
• /
• pp.65-72
• /
• 2015

The minimum rank mr(G) of a simple graph G is defined to be the smallest possible rank over all symmetric real matrices whose (i, j)-th entry (for $i{\neq}j$) is nonzero whenever {i, j} is an edge in G and is zero otherwise. The corona $C_n{\circ}K_t$ is obtained by joining all the vertices of the complete graph $K_t$ to each n vertex of the cycle $C_n$. For any t, we obtain an upper bound of zero forcing number of $L(C_n{\circ}K_t)$, the line graph of $C_n{\circ}K_t$, and get some bounds of $mr(L(C_n{\circ}K_t))$. Specially for t = 1, 2, we have calculated $mr(L(C_n{\circ}K_t))$ by the cut-vertex reduction method.

• Kyungpook Mathematical Journal
• /
• v.48 no.3
• /
• pp.465-472
• /
• 2008

For a nonnegative real matrix A of rank 1, A can be factored as $ab^t$ for some vectors a and b. The perimeter of A is the number of nonzero entries in both a and b. If B is a matrix of rank k, then B is the sum of k matrices of rank 1. The perimeter of B is the minimum of the sums of perimeters of k matrices of rank 1, where the minimum is taken over all possible rank-1 decompositions of B. In this paper, we obtain characterizations of the linear operators which preserve perimeters 2 and k for some $k\geq4$. That is, a linear operator T preserves perimeters 2 and $k(\geq4)$ if and only if it has the form T(A) = UAV or T(A) = $UA^tV$ with some invertible matrices U and V.

• Honam Mathematical Journal
• /
• v.29 no.3
• /
• pp.427-443
• /
• 2007

The spanning column rank of an $m{\times}n$ integer matrix A is the minimum number of the columns of A that span its column space. We compare the spanning column rank with column rank of matrices over the ring of integers. We also characterize the linear operators that preserve the spanning column rank of integer matrices.

• Journal of the Korean Mathematical Society
• /
• v.54 no.4
• /
• pp.1317-1329
• /
• 2017

A Boolean rank one matrix can be factored as $\text{uv}^t$ for vectors u and v of appropriate orders. The perimeter of this Boolean rank one matrix is the number of nonzero entries in u plus the number of nonzero entries in v. A Boolean matrix of Boolean rank k is the sum of k Boolean rank one matrices, a rank one decomposition. The perimeter of a Boolean matrix A of Boolean rank k is the minimum over all Boolean rank one decompositions of A of the sums of perimeters of the Boolean rank one matrices. The arctic rank of a Boolean matrix is one half the perimeter. In this article we characterize the linear operators that preserve the symmetric arctic rank of symmetric Boolean matrices.

• Journal of the Korean Mathematical Society
• /
• v.56 no.6
• /
• pp.1503-1514
• /
• 2019

A rank 1 matrix has a factorization as $uv^t$ for vectors u and v of some orders. The arctic rank of a rank 1 matrix is the half number of nonzero entries in u and v. A matrix of rank k can be expressed as the sum of k rank 1 matrices, a rank 1 decomposition. The arctic rank of a matrix A of rank k is the minimum of the sums of arctic ranks of the rank 1 matrices over all rank 1 decomposition of A. In this paper we obtain characterizations of the linear operators that strongly preserve the symmetric arctic ranks of symmetric matrices over nonnegative reals.

• Journal of the Korean Mathematical Society
• /
• v.36 no.6
• /
• pp.1181-1190
• /
• 1999

Zero-term rank of a matrix is the minimum number of lines (rows or columns) needed to cover all the zero entries of the given matrix. We characterized the linear operators that preserve zero-term rank of the m×n matrices over binary Boolean algebra.

• Journal of the military operations research society of Korea
• /
• v.25 no.2
• /
• pp.84-96
• /
• 1999

The purpose of this paper is to find the most vital arc in the minimum cost flow problem. The most vital arc is the arc whose removal results in the greatest influence in the costs or the amount of demands in a given minimum cost flow network. This problem can be well applied to the conflict situations such as military logistics network or communications network. In this situation, network user wants to know which arcs are the most vital to him so that he can reinforce these arcs against attack, while interdictor wants to destroy these arcs which increase the distance of the shortest path most through the network. When one of arcs is removed from the network of the minimum cost flow problem, two kinds of situations can be occurred ; breaking feasibility and increasing cost. In case of breaking feasibility, the rank of arcs are determined using the amount of modified flow in a related network which is made of modifying the optimal alternative of the minimum cost flow problem. The rank of arcs with the increased costs are determined by using a method which finds the directed cycle with the minimum cost in a related network.

• Journal of the Korean Mathematical Society
• /
• v.46 no.1
• /
• pp.113-123
• /
• 2009

A rank one matrix can be factored as $\mathbf{u}^t\mathbf{v}$ for vectors $\mathbf{u}$ and $\mathbf{v}$ of appropriate orders. The perimeter of this rank one matrix is the number of nonzero entries in $\mathbf{u}$ plus the number of nonzero entries in $\mathbf{v}$. A matrix of rank k is the sum of k rank one matrices. The perimeter of a matrix of rank k is the minimum of the sums of perimeters of the rank one matrices. In this article we characterize the linear operators that preserve perimeters of matrices over semirings.

• Bulletin of the Korean Mathematical Society
• /
• v.45 no.2
• /
• pp.355-363
• /
• 2008

For a Boolean rank 1 matrix $A=ab^t$, we define the perimeter of A as the number of nonzero entries in both a and b. The perimeter of an $m{\times}n$ Boolean matrix A is the minimum of the perimeters of the rank-1 decompositions of A. In this article we characterize the linear operators that preserve the perimeters of Boolean matrices.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.60.1-60
• /
• 2002

. an output feedback stabilizing controller for non-minimum phase nonlinear systems . Assumption 1 : the Jacobi linearization of the given nonlinear linear system is controllable . Assumption 2: an appropriate transformation which transforms the zero dynamics into a special form . Assumption 3: the system satisfies the observability rank condition . Augmentation of systems by augmented by a chain of integrators