• Kyungpook Mathematical Journal
• /
• v.54 no.1
• /
• pp.23-30
• /
• 2014

For two positive integers r and s, $\mathcal{G}$(n; r; ${\theta}_s$) denotes to the class of graphs on n vertices containing no r of edge disjoint ${\theta}_s$-graphs and f(n; r; ${\theta}_s$) = max{${\varepsilon}(G)$ : G ${\in}$ $\mathcal{G}$(n; r; ${\theta}_s$)}. In this paper, for integers r, $k{\geq}2$, we determine f(n; r; ${\theta}_{2k+1}$) and characterize the edge maximal members in G(n; r; ${\theta}_{2k+1}$).

• International Journal of Precision Engineering and Manufacturing
• /
• v.6 no.1
• /
• pp.15-22
• /
• 2005

This research presents modeling of a functional surface that is constructed with a free-formed surface. The modeling of functional surfaces, being introduced in this paper, adopts a modified B-spline that utilizes an approximating technique. The modified B-Spline is constructed with altered control vertices. It is applied to measure the surface of an impeller blade. This research builds an algorithm accepting inputs of measured points. Generating the cutter-paths for NC machining employs the model of the constructed surfaces. The machined surfaces that are generated in several cases are compared with each other in the aspect of machining accuracy.

• Journal of Magnetics
• /
• v.6 no.1
• /
• pp.36-41
• /
• 2001

A micromagnetic model and a single-domain model simulation programs were used to analyze the sensitivity of a $20\mu m\times 60\mu m \times 1000{\AA}$ permalloy strip as a magnetoresistance sensor with bias fields of various directions and magnitudes. The micromagnetic model agrees with the measured sensitivity data better than the single-domain model. The data show the highest peak sensitivity with the bias field at 90$^{\circ}$to the current. The peak sensitivity decreases and the peak broadens as the bias angle decreases. The simulation using the micromagnetic model shows that a bias angle smaller than 90$^{\circ}$eads to magnetization patterns which are free from closure domains or vertices over a wider range of bias fields.

• Journal of applied mathematics & informatics
• /
• v.14 no.1_2
• /
• pp.185-191
• /
• 2004

Given a connected graph G, we say that a set EC\;{\subseteq}\;V(G)$ is convex in G if, for every pair of vertices x, $y\;{\in}\;C$, the vertex set of every x - y geodesic in G is contained in C. The convexity number of G is the cardinality of a maximal proper convex set in G. In this paper, we show that every pair k, n of integers with $2\;{\leq}k\;{\leq}\;n\;-\;1$ is realizable as the convexity number and order, respectively, of some connected triangle-free graph, and give a lower bound for the convexity number of k-regular graphs of order n with n > k+1.

• Journal of the Korean Society for Precision Engineering
• /
• v.20 no.10
• /
• pp.156-163
• /
• 2003

This research presents modeling of a functional surface which is a constructed free-formed surface. The modeling introduced in this paper adopts modified B-spline that is utilizing approximating technique. The modified B-Spline is constructed with altered control vertices. It is applied to measure points on a surface of an impeller blade. This research builds a surface-modeler accepting inputs of measured points. Generation of cutter-paths for NC machining employs the model of the constructed surfaces. The machined surfaces which is generated in several cases are compared in the aspect of machining accuracy.

• IE interfaces
• /
• v.8 no.3
• /
• pp.133-139
• /
• 1995

Free from curves and surfaces are frequently used in designing engineering products such as car, ship, airplane, and hosing of electronic households. In many aspect, it is very nice to use the cutter radius compensation function of CNC controller when contour machining a 2-dimensional curve. However, if the 2D curve is a parametric spline, it is not easy to apply the cutter radius compensation function of CNC controller to the NC data obtained from many commercial CAM system. This is mainly due to the error magnification effect when offsetting line segments with inevitable round-off error at their vertices. Proposed in this paper is an approach to contour machining a 2D parametric spline while using cutter radius compensation. Some implementation results are included.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.5
• /
• pp.263-269
• /
• 2014

In this paper, I disprove Hadwiger conjecture of the vertex coloring problem, which asserts that "All $K_k$-minor free graphs can be colored with k-1 number of colors, i.e., ${\chi}(G)=k$ given $K_k$-minor." Pursuant to Hadwiger conjecture, one shall obtain an NP-complete k-minor to determine ${\chi}(G)=k$, and solve another NP-complete vertex coloring problem as a means to color vertices. In order to disprove Hadwiger conjecture in this paper, I propose an algorithm of linear time complexity O(V) that yields the exact solution to the vertex coloring problem. The proposed algorithm assigns vertex with the minimum degree to the Maximum Independent Set (MIS) and repeats this process on a simplified graph derived by deleting adjacent edges to the MIS vertex so as to finally obtain an MIS with a single color. Next, it repeats the process on a simplified graph derived by deleting edges of the MIS vertex to obtain an MIS whose number of vertex color corresponds to ${\chi}(G)=k$. Also presented in this paper using the proposed algorithm is an additional algorithm that searches solution of ${\chi}^{{\prime}{\prime}}(G)$, the total chromatic number, which also remains NP-complete. When applied to a $K_4$-minor graph, the proposed algorithm has obtained ${\chi}(G)=3$ instead of ${\chi}(G)=4$, proving that the Hadwiger conjecture is not universally applicable to all the graphs. The proposed algorithm, however, is a simple algorithm that directly obtains an independent set minor of ${\chi}(G)=k$ to assign an equal color to the vertices of each independent set without having to determine minors in the first place.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.29 no.3 s.234
• /
• pp.447-454
• /
• 2005

This paper presents a new paradigm for 3-axis tool path generation based on an incomplete 2-manifold mesh model, namely, an inexact polyhedron. When geometric data is transferred from one system to another system and tessellated for tool path generation, the model does not have any topological data between meshes and facets. In contrast to the existing polyhedral machining approach, the proposed method generates tool paths from an incomplete 2-manifold mesh model. In order to generate gouge-free tool paths, CL-meshes are generated by offsetting boundary edges, boundary vertices, and facets. The CL-meshes are sliced by machining planes and the calculated intersections are sorted, trimmed, and linked. The grid method is used to reduce the computing time when range searching problems arise. The method is fully implemented and verified by machining an incomplete 2-manifold mesh model.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.26 no.1
• /
• pp.125-132
• /
• 2002

An experimental study on the characteristics of stability of propane turbulent nonpremixed jet flames discharged normal to air free-streams with uniform velocity profile is conducted. Experimental observations are focused on the flame shape, the stability considering two kinds of flame, lift-off distance, and the flame length according to velocity ratio. In order to investigate the mixing structure of the flame base at the lower limit, we employ the RMS technique and measure the species concentration by a gas chromatography. In the results of the stability curve and lifted flame, it is fecund that the dependency of nozzle diameter is closely related to the large-scale vortical structure representing counter-rotating vortices pair. Also, the detailed discussion on the phenomenon of blowout due to this large vortical motion, is provided.

• Journal of the Korean Society for Precision Engineering
• /
• v.15 no.8
• /
• pp.46-59
• /
• 1998

This paper presents shape design, surface construction, and cutting path generation for the surface of marine ship propeller blades. A propeller blade should be designed to satisfy performance constraints that include operational speed which impacts rotations per minutes, stresses related to deliverable horst power, and the major length of the marine ship which impacts the blade size and shape characteristics. Primary decision variables that affect efficiency in the design of a marine ship propeller blade are the blade diameter and the expanded area ratio. The blade design resulting from these performance constraints typically consists of sculptured surfaces requiring four or five axis contoured machining. In this approach a standard blade geometry description consisting of blade sections with offset nominal points recorded in an offset table is used. From this table the composite Bezier surface geometry of the blade is created. The control vertices of the Hazier surface patches are determined using a chord length fitting procedure from tile offset table data. Cutter contact points and path intervals are calculated to minimize travel distance and production time while maintaining a cusp height within tolerance limits. Long path intervals typically generate short tool paths at the expense of increased however cusp height. Likewise, a minimal tool path results in a shorter production time. Cutting errors including gouging and under-cut, which are common errors in machining sculptured surfaces, are also identified for both convex and concave surfaces. Propeller blade geometry is conducive to gouging. The result is a minimal error free cutting path for machining propeller blades for marine ships.