• Bulletin of the Korean Mathematical Society
• /
• v.56 no.4
• /
• pp.1059-1075
• /
• 2019

Let G be a graph with no isolated vertex. A total dominating set, abbreviated TDS of G is a subset S of vertices of G such that every vertex of G is adjacent to a vertex in S. The total domination number of G is the minimum cardinality of a TDS of G. In this paper, we study the total domination number of central graphs. Indeed, we obtain some tight bounds for the total domination number of a central graph C(G) in terms of some invariants of the graph G. Also we characterize the total domination number of the central graph of some families of graphs such as path graphs, cycle graphs, wheel graphs, complete graphs and complete multipartite graphs, explicitly. Moreover, some Nordhaus-Gaddum-like relations are presented for the total domination number of central graphs.

• Bulletin of the Korean Mathematical Society
• /
• v.57 no.1
• /
• pp.245-250
• /
• 2020

Let γt(G) and τ(G) denote the total domination number and vertex cover number of graph G, respectively. In this paper, we study the total domination number of the central tree C(T) for a tree T. First, a relationship between the total domination number of C(T) and the vertex cover number of tree T is discussed. We characterize the central trees with equal total domination number and independence number. Applying the first result, we improve the upper bound on the total domination number of C(T) and solve one open problem posed by Kazemnejad et al..

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.7
• /
• pp.41-47
• /
• 2015

The bandwidth minimization problem (BMP) has been classified as NP-complete because the polynomial time algorithm to find the optimal solution has been unknown yet. This paper suggests polynomial time heuristic algorithm is to find the solution of bandwidth minimization problem. To find the minimum bandwidth ${\phi}^*=_{min}{\phi}(G)$, ${\phi}(G)=_{max}\{{\mid}f(v_i)-f(v_j):v_i,v_j{\in}E\}$ for given graph G=(V,E), m=|V|,n=|E|, the proposed algorithm sets the maximum degree vertex $v_i$ in graph G into global central point (GCP), and labels the median value ${\lceil}m+1/2{\rceil}$ between [1,m] range. The graph G is partitioned into subgroup, the maximum degree vertex in each subgroup is set to local central point (LCP), and we adjust the label of LCP per each subgroup as possible as minimum distance from GCP. The proposed algorithm requires O(mn) time complexity for label to all of vertices. For various twelve graph, the proposed algorithm can be obtains the same result as known optimal solution. For one graph, the proposed algorithm can be improve on known solution.

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

Facility location problems deal with the concept of centrality and centrality questions are examined using graphs and eccentricity. In this paper, we give interesting properties of a tree in relation with the number of central vertices and peripheral vertices. Also we have some conditions to be an eccentric graph in terms of the girth of a graph.

• Journal of the Korean Mathematical Society
• /
• v.39 no.3
• /
• pp.461-494
• /
• 2002

Let G = E${\ast}_{A}F$, where A is a finitely generated abelian subgroup. We prove a criterion for G to be {A}-double coset separable. Applying this result, we show that polygonal products of central subgroup separable groups, amalgamating trivial intersecting central subgroups, are double coset separable relative to certain central subgroups of their vertex groups. Finally we show that such polygonal products are conjugacy separable. It follows that polygonal products of polycyclic-by-finite groups, amalgamating trivial intersecting central subgroups, are conjugacy separable.

• Journal of Trauma and Injury
• /
• v.30 no.3
• /
• pp.98-102
• /
• 2017

Vertex epidural hematoma (VEH) is an uncommon presentation of all epidural hematomas and presents with a wide range of symptom and signs. Diagnosis as well as treatment of VEH is also difficult because of its location adjacent to superior sagittal sinus (SSS). A 43-year-old male visited our hospital after fall down and was diagnosed with VEH. While evaluating its location and patency of SSS, he was deteriorated and urgently underwent evacuation of VEH. Bilateral craniotomies on each side, leaving a central bony island to avoid bleeding of midline structure and provide an anchor for dural tack-ups. After the operation, VEH was totally removed and the patient has restored.

• Journal of the Korean Mathematical Society
• /
• v.60 no.5
• /
• pp.959-986
• /
• 2023

Zhai and Lin recently proved that if G is an n-vertex connected 𝜃(1, 2, r + 1)-free graph, then for odd r and n ⩾ 10r, or for even r and n ⩾ 7r, one has ${\rho}(G){\leq}{\sqrt{{\lfloor}{\frac{n^2}{4}}{\rfloor}}}$, and equality holds if and only if G is $K_{{\lceil}{\frac{n}{2}}{\rceil},{\lfloor}{\frac{n}{2}}{\rfloor}}$. In this paper, for large enough n, we prove a sharp upper bound for the spectral radius in an n-vertex H-free non-bipartite graph, where H is 𝜃(1, 2, 3) or 𝜃(1, 2, 4), and we characterize all the extremal graphs. Furthermore, for n ⩾ 137, we determine the maximum number of edges in an n-vertex 𝜃(1, 2, 4)-free non-bipartite graph and characterize the unique extremal graph.

• Journal of the Korean Mathematical Society
• /
• v.60 no.1
• /
• pp.227-253
• /
• 2023

In this article, we generalize the results discussed in [6] by introducing a genus to generic fibers of Lefschetz fibrations. That is, we give families of relations in the mapping class groups of genus-1 surfaces with boundaries that represent rational homology disk smoothings of weighted homogeneous surface singularities whose resolution graphs are 3-legged with a bad central vertex.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.44
• /
• pp.497-506
• /
• 1997

In this paper described is the software developed to calculate the physical properties of arbitrary section shape. The software consists of arbitrary section display module(ASDM) and section property calculation module(SPCM). ASDM defines and displays the shape of arbitrary section and SPCM calculates its properties such as area, centroid, moment of inertia, torsional constant, etc.. In many cases, calculation of section properties is not easy because user has to define the vertex coordinates which are difficult to do so in the case of arbitrary section. In the developed software, however, since user is asked to define only points of central lines and thickness of arbitrary section, the calculattion task of arbitrary section is very effective.

• 한국전산유체공학회:학술대회논문집
• /
• 2011.05a
• /
• pp.20-24
• /
• 2011

In this paper, numerical simulation of cavitation flow for modified NACA66 hydrofoil was made by using the multi-phase RANS equation based on pseudo-compressibility. The Homogeneous mixture model comprised of the mixture continuity, mixture momentum and liquid volume fraction equations was utilized. A vertex-centered finite-volume method was used in conjunction 2nd-order Roe's FDS to discretize the inviscid fluxes. The viscous fluxes were computed based on central differencing The Spalart-Allmaras one equation model was employed for the closure of turbulence. Reasonable agreements were obtained between the calculation results and the experiment for pressure coefficients on the hydrofoil surface.