http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
정내경,임형규,박세원,Jeong, Nae-Gyeong,Im, Hyung-Kyu,Park, Se-Won Korea Institute of Electronic Communication Scienc 2010 한국전자통신학회 논문지 Vol.5 No.3
In this paper, we study the adjacency matrix of a minimal connected quadrangular graph G, and then we obtain an upper bound on |E(G)| for such a graph G, and we obtain the graph for which the upper bound is attained. In addition, we obtain an upper bound on |E(G)| for a critical matching covered quadrangular graph G.
For The Matrix Sandwich Problems
Nae-Gyeong Jeong(정내경),Se-Won Park(박세원) 한국엔터테인먼트산업학회 2015 한국엔터테인먼트산업학회논문지 Vol.9 No.2
Problems based on a variety of properties have been studied, but the positive definite completion problem has received the most attention. We research the positive definite problem on the several conditions. A completion of a partial matrix is a choice of values for the unspecified entries resulting in a conventional matrix, and the positive definite (semidefinite) completion problem is to determine whether there exists a positive definite (semidefinite) completion of a given partial symmetric matrix. Since any principal submatrix of a positive definite matrix is positive definite, a necessary condition that a partial symmetric matrix A have a positive definite completion is that A be partial positive definite. The same is true for positive semidefinite. This obvious necessary condition is also sufficient in the case that the graph of A is chordal. In this paper we give the matrix sandwich that concentrate on nonsymmetric (0,1)-normal matrices.
For The Positive Definite Problem
Nae-Gyeong Jeong(정내경),Se-Won Park(박세원) 한국엔터테인먼트산업학회 2013 한국엔터테인먼트산업학회논문지 Vol.7 No.2
Problems based on a variety of properties have been studied, but the positive definite completion problem has received the most attention. We research the positive definite problem on the several conditions.