• Journal of the Korean Mathematical Society
• /
• v.57 no.5
• /
• pp.1299-1322
• /
• 2020

We consider closed, star-shaped, admissible hypersurfaces in ℝⁿ⁺¹ expanding along the flow Ẋ = |X|^α-1 F^-β, α ≤ 1, β > 0, and prove that for the case α ≤ 1, β > 0, α + β ≤ 2, this evolution exists for all the time and the evolving hypersurfaces converge smoothly to a round sphere after rescaling. Besides, for the case α ≤ 1, α + β > 2, if furthermore the initial closed hypersurface is strictly convex, then the strict convexity is preserved during the evolution process and the flow blows up at finite time.

• East Asian mathematical journal
• /
• v.8 no.1
• /
• pp.9-17
• /
• 1992

• East Asian mathematical journal
• /
• v.9 no.1
• /
• pp.83-92
• /
• 1993

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.5 no.2
• /
• pp.53-61
• /
• 2001

We introduce sums and joins of fuzzy finite state machines and investigate their algebraic structures.

• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.639-647
• /
• 2005

We count the number of maximal independent sets of binary trees and planted plane trees.

• Journal of applied mathematics & informatics
• /
• v.12 no.1_2
• /
• pp.375-384
• /
• 2003

We introduce some algorithms for computing Mathematics and also give some questions based on the results from computations using CoCoA and Splus.

• Kyungpook Mathematical Journal
• /
• v.32 no.3_spc
• /
• pp.463-475
• /
• 1992

• Kyungpook Mathematical Journal
• /
• v.34 no.2
• /
• pp.187-192
• /
• 1994

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.11 no.3
• /
• pp.65-75
• /
• 2007

A graph G is self-complementary (sc) if it is isomorphic to its complement. G is perfect if for all induced subgraphs H of G, the chromatic number of H (denoted ${\chi}$(H)) equals the number of vertices in the largest clique in H (denoted ${\omega}$(H)). An sc graph which is also perfect is known as sc perfect graph. A comparability graph is an undirected graph if it can be oriented into transitive directed graph. An sc comparability (scc) is clearly a subclass of sc perfect graph. In this paper we show that no two non-isomorphic scc graphs with n vertices each, (n<13) have same spectrum, and that the smallest positive integer for which there exists hyper-energetic scc graph is 13.

• Journal of applied mathematics & informatics
• /
• v.41 no.2
• /
• pp.287-293
• /
• 2023

In this paper, the Augmented graph Es(τ) of the inverse graph Gs(τ) of a cyclic group (τ,◦) was studied. The Augmented inverse graph was constructed by applying the method of Mycielski's construction. The dimension of Augmented inverse graph and different properties of the graph were investigated. Later the chromatic number of Augmented inverse graph was discussed and the relation between the maximum degree of the graph and the chromatic number was established. In the Mycielski's construction, the properties of the key node 'u' in Es (τ) were established based on cardinality of the cyclic group (τ,◦) and also proved that the Augmented inverse graph Es(τ) was a triangle free graph.