• Journal of Applied and Pure Mathematics
• /
• v.5 no.3_4
• /
• pp.237-253
• /
• 2023

Let a graph G = (V, E) be a (p, q) graph. Define $${\rho}=\{\array{{\frac{p}{2}} & \;\;p\text{ is even} \\ {\frac{p-1}{2}} & \;\;p\text{ is odd,}$$ and M = {±1, ±2, … ± ρ} called the set of labels. Consider a mapping λ : V → M by assigning different labels in M to the different elements of V when p is even and different labels in M to p - 1 elements of V and repeating a label for the remaining one vertex when p is odd. The labeling as defined above is said to be a pair mean cordial labeling if for each edge uv of G, there exists a labeling ${\frac{{\lambda}(u)+{\lambda}(v)}{2}}$ if λ(u) + λ(v) is even and ${\frac{{\lambda}(u)+{\lambda}(v)+1}{2}}$ if λ(u) + λ(v) is odd such that ${\mid}{\bar{{\mathbb{S}}}}_{\lambda}{_1}-{\bar{{\mathbb{S}}}}_{{\lambda}^c_1}{\mid}{\leq}1$ where ${\bar{{\mathbb{S}}}}_{\lambda}{_1}$ and ${\bar{{\mathbb{S}}}}_{{\lambda}^c_1}$ respectively denote the number of edges labeled with 1 and the number of edges not labeled with 1. A graph G for which there exists a pair mean cordial labeling is called a pair mean cordial graph. In this paper, we investigate the pair mean cordial labeling behavior of few graphs including the closed helm graph, web graph, jewel graph, sunflower graph, flower graph, tadpole graph, dumbbell graph, umbrella graph, butterfly graph, jelly fish, triangular book graph, quadrilateral book graph.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.702-705
• /
• 2003

Directed graph and Lindenmayer system (L-system) are two major encoding methods of representation to develop creatures in an application field of artificial life. It is difficult to structurally define real morphology using the L-systems which are a grammatical rewriting system because they represent genotype as loops, procedure calls, variables, and parameters. This paper defines a class of representations called structured directed graph and interactive genetic algorithm for automatically creating 3D flower morphology. The experimental results show that natural flower morphology can be created by the proposed method.

• Journal of applied mathematics & informatics
• /
• v.41 no.3
• /
• pp.615-631
• /
• 2023

A power cordial labeling of a graph G = (V (G), E(G)) is a bijection f : V (G) → {1, 2, ..., |V (G)|} such that an edge e = uv is assigned the label 1 if f(u) = (f(v))ⁿ or f(v) = (f(u))ⁿ, For some n ∈ ℕ ∪ {0} and the label 0 otherwise, then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. In this paper, we investigate power cordial labeling for helm graph, flower graph, gear graph, fan graph and jewel graph as well as larger graphs obtained from star and bistar using graph operations.

• Journal of KIISE:Software and Applications
• /
• v.31 no.3
• /
• pp.267-275
• /
• 2004

Directed graph and Lindenmayer system (L-system) are two major encoding methods of representation to develop creatures in application field of artificial life. It is difficult to define real morphology structurally using the L-systems which are a grammatical rewriting system because L-systems represent genotype as loops, procedure calls, variables, and parameters. This paper defines a class of representations called structured directed graph, which is identified by its ability to define structures of the genotype in the translation to the phenotype, and presents an example of creating 3D flowers using a directed graph which is proper method to represent real morphology, and interactive genetic algorithm which decodes the problem with human's emotional evaluation. The experimental results show that natural flower morphology can be generated by the proposed method.

• Journal of the Korean Society of Tobacco Science
• /
• v.6 no.1
• /
• pp.3-11
• /
• 1984

In order to obtain the basic information for the successful breeding of aromatic tobacco (Nicotiana tabacum L.), the heterosis, combining ability and gene distributions in 28 Fl hybrids by diallel crosses between Korea local and Oriental varieties were investigated. The yield were higher, stalk height, leaf length and leaf width were larger and days to flower was shorter for the Fl hybrids when compared to mid-parent. Estimates of general combining ability were significant for all characters investigated, and specific combining ability were significant for yield, stalk height, leaves Per Plant, leaf width and days to flower. In vr-wr graph, partial dominane was exhibited by all characters investigated.

• Korean Chemical Engineering Research
• /
• v.54 no.1
• /
• pp.75-80
• /
• 2016

Biologically stabilized gold nanoparticles were synthesized from the flower aqueous extract of T. divaricata. The synthesized nanoparticles were characterized by UV-Vis spectrophotometer, Zeta sizer, FTIR and TEM analysis. T. divaricata reduced gold nanoparticles having particle size and potential of 106.532 nm and -10.2 mV, respectively, with a characteristic peak of 550 nm in UV-visible spectrophotometer. FTIR graph after comparison between the crude flower extract and gold nanoparticles showed three major shifts in the functional groups. The morphology and size of the gold nanoparticles were examined by HRTEM analysis, which showed that most of the nanoparticles were nearly spherical with size of 100 nm. The gold nanoparticles synthesized demonstrated potent anticancer activity against MCF-7 cell line. The findings conclude that the antioxidant molecule present in T. divaricata may be responsible for both reduction and capping of gold nanoparticles which possess potential applications in medicine and pharmaceutical fields.

• Journal of Institute of Control, Robotics and Systems
• /
• v.21 no.9
• /
• pp.858-862
• /
• 2015

This paper presents a new forward-viewing mono-camera based obstacle detection algorithm for mobile robots. The proposed method extracts the coarse location of an obstacle in an image using inverse perspective mapping technique from sequential images. In the next step, graph-cut based image labeling is conducted for estimating the exact obstacle boundary. The graph-cut based labeling algorithm labels the image pixels as either obstacle or floor as the final outcome. Experiments are performed to verify the obstacle detection performance of the developed algorithm in several examples, including a book, box, towel, and flower pot. The low illumination condition, low color contrast between floor and obstacle, and floor pattern cases are also tested.