• Journal of applied mathematics & informatics
• /
• v.31 no.3_4
• /
• pp.469-477
• /
• 2013

Pattabiraman and Paulraja [K. Pattabiraman, P. Paulraja, Vertex and edge PI indices of the generalized hierarchical product of graphs, Discrete Appl. Math. 160 (2012) 1376- 1384] obtained exact formulas for the vertex and edge PI indices of generalized hierarchical product of graphs. The aim of this note is to improve the main results of this paper.

• 한국전산유체공학회:학술대회논문집
• /
• 2006.10a
• /
• pp.57-60
• /
• 2006

This paper presents an assessment of vertex-centered and cell-centered finite-volume methods on unstructured meshes. The results indicate that the vertex-centered method is more reliable than the cell-centered method.

• Journal of Korean Ophthalmic Optics Society
• /
• v.15 no.1
• /
• pp.25-30
• /
• 2010

Purpose: This study was conducted to estimate the changes of corrected diopter and corrected visual acuity with the change in vertex distance. Also we aimed to provide basic data for refraction test. Methods: Using the trial lens, we measured the corrected diopter and corrected visual acuity after performing binocular balance test. We measured the changes of corrected diopter and corrected visual acuity in change of vertex distance. We analyzed statistical significance and relations between vertex distance and corrected diopter and corrected visual acuity. Results: There was no difference in corrected diopter with the change of vertex distance within -1.00D, but the corrected diopter increased with it over - 1.25D. In particular, the change of diopter was largest when the vertex distance increased 15 mm. At over 11.00D, there was large changes of diopter with the changes of vertex distance at 5 mm, 10 mm and 15 mm. On correlation analysis between the vertex distance and the corrected diopter, there was strong correlation (r=0.999 at 5 mm increase of vertex distance, r=0.982 at 10 mm increase and r=0.957 at 15 mm increase) and also there was significant (p<0.01). At the change of visual acuity in increased of vertex distance, the range of a decrease in visual acuity was large when the changes of vertex distance was largest. On correlation analysis between the vertex distance and the corrected visual acuity, there was strong correlation (r=0.969 at 5 mm increase of vertex distance, r=0.985 at 10 mm increase and r=0.994 at 15 mm increase) and also there was significant (p<0.01). Conclusions: The vertex distance was very important at the refraction test and at wearing spectacle. On correlation analysis between the vertex distance and the corrected diopter, and the corrected visual acuity, there was strong correlation and statistically significant. Therefore, the vertex distance should be kept at the refraction using trial lens, and the best fitting was made not to slipping forward, and so we suggested regular refitting of spectacle and the managing method of spectacle were educated to the spectacle wearers.

• Journal of applied mathematics & informatics
• /
• v.25 no.1_2
• /
• pp.339-344
• /
• 2007

The relationships between binding number and fractional edge (vertex)-deletability or fractional k-extendability of graphs are studied. Furthermore, we show that the result about fractional vertex-deletability are best possible.

• Korean Journal of Mathematics
• /
• v.18 no.4
• /
• pp.369-380
• /
• 2010

We give a criterion for vertex extremal length parabolicity of locally finite planar graphs, and use it to show that a disk triangulation graph is circle packing parabolic if and only if its immediate finer graphs are circle packing parabolic.

• 대한방사선방어학회:학술대회논문집
• /
• 2011.11a
• /
• pp.116-117
• /
• 2011

• The Pure and Applied Mathematics
• /
• v.5 no.1
• /
• pp.65-72
• /
• 1998

We investigate a chain of properties of real function algebras along the analogous proofs of the complex cases such as the fact that any real function algebra which is both maximal and essential is pervasive. And some properties of real function algebras with a vertex property will be discussed.

• Journal of applied mathematics & informatics
• /
• v.32 no.1_2
• /
• pp.1-6
• /
• 2014

Let G = (V ; E) be a simple undirected graph without loops and multiple edges, the vertex and edge sets of it are represented by V = V (G) and E = E(G), respectively. A weighting w of the edges of a graph G induces a coloring of the vertices of G where the color of vertex v, denoted $S_v:={\Sigma}_{e{\ni}v}\;w(e)$. A k-edge-weighting of a graph G is an assignment of an integer weight, w(e) ${\in}${1,2,...,k} to each edge e, such that two vertex-color $S_v$, $S_u$ be distinct for every edge uv. In this paper we determine an exact 3-edge-weighting of complete graphs $k_{3q+1}\;{\forall}_q\;{\in}\;{\mathbb{N}}$. Several open questions are also included.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10c
• /
• pp.650-652
• /
• 1998

본 논문은 mesh 간략화를 위한 새로운 Gaussian 곡률 오차 추정 방법을 제안한다. Gaussian 곡률은 임의의 형상을 갖는 삼각화 된 단면체 표면에 대하여 위상과 기하학적 정보를 angle 과 face 의 관계로 정형화하여, vertex에 관한 곡률로 근사하여 표현한다. 간략화 방법은 지역적 형상으로부터 전체적인 형상을 추정한 후, 적절한 curvature criteria 로 간략화가 될 vertex를 선택하고 제거한다. 제거된 vertex에 의해 생성된 hole은 곡률에 기반하여 삼각화하고 곡률이 변화되는 vertex들의 Gaussian 곡률 오차를 계산한다. 각 간략화 level마다 최대 Gaussian 곡률 오차를 계산하므로, 사용자는 Gaussian 곡률 오차 추정으로 원하는 간략화 level을 지정할 수 있다. 또한 주어진 오차 안에서 vertex뿐만 아니라 edge나 face의 제거로, 간략화 되는 영역을 확산시켜 필요한 위상과 기하학적 정보를 유지하는 간략화를 할 수 있다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.3
• /
• pp.185-193
• /
• 2003

The conventional parallelogram prediction uses only three previously traversed vertices in a single adjacent triangle; thus, the predicted vertex can be located at a biased position. Moreover, vortices on curved surfaces may not be predicted effectively since each parallelogram is assumed to lie on the same plane. In order to improve the prediction performance, we use all the neighboring vertices that precede the current vertex. After we order vortices using a vertex layer traversal algorithm, we estimate the current vertex position based on observations of the previously coded vertex positions in the layer traversal order. The difference between the original and the predicted vertex coordinate values is encoded by a uniform quantizer and an entropy coder. The proposed scheme demonstrates improved coding efficiency for various VRML test data.