• 패션비즈니스
• /
• 제12권4호
• /
• pp.73-87
• /
• 2008

The main objective of this research was to investigate the characteristics of achromatic & chromatic color coordination of contemporary female fashion by reviewing 'pre-a-porter Collections' of four collections (i. e. cities) - Paris, Milan, New York, London - from the periods of 2002 S/S to 2006/7 A/W. The data was collected by reviewing 'pre-a-porter Collections' magazine and total 677 observations were made. Statistical analysis of frequency and also qualitative interpretation of achromatic & chromatic color coordination characteristics were completed. The main findings were; (1) The achromatic & chromatic color coordination was identified as one of most used color coordination in contmeporary women's fashion collections. (2) Black and white mainly used for achromatic color, and brown used the most often, then followed by blue, red, yellow, green and the others for chromatic color in achromatic & chromatic coordination of contmeporary women's fashion collections. (3) The characteristics of achromatic & chromatic color coordination of modern women's fashion collections from 2002 S/S to 2006/07 A/W showed various images according to chromatic colors and tone variation. The combination of achromaticand brown color variations produced an intelligent and sophisticated image. The soft or light chromatic color and chromatic color combination projected soft, feminine and subtle feeling, while the combination of vivid or strong chromatic color and achromatic color projected a clean and strong feeling through contrasting tones of clear and bright colors. The chromatic color of deep or dark tone and black combination demonstrated supernatural and gloomy image. (4)In all four collections, Paris showed most use of two color coordination and then followed by Milan, N.Y, and London. N.Y showed higher rate of using achromatic & chromatic color coordination, and then followed by Paris, London and Milan.

• Journal of applied mathematics & informatics
• /
• 제34권1_2호
• /
• pp.49-60
• /
• 2016

In this paper, two different approaches to chromatic number of a bipolar fuzzy graph are introduced. The first approach is based on the α-cuts of a bipolar fuzzy graph and the second approach is based on the definition of Eslahchi and Onagh for chromatic number of a fuzzy graph. Finally, the bipolar fuzzy vertex chromatic number and the edge chromatic number of a complete bipolar fuzzy graph, characterized.

• Journal of applied mathematics & informatics
• /
• 제12권1_2호
• /
• pp.129-142
• /
• 2003

In this paper we study the chromatic sum functions for rooted nonseparable simple maps on the plane. The chromatic sum function equation for such maps is obtained . The enumerating function equation of such maps is derived by the chromatic sum equation of such maps. From the chromatic sum equation of such maps, the enumerating function equation of rooted nonseparable simple bipartite maps on the plane is also derived.

• Current Optics and Photonics
• /
• 제4권1호
• /
• pp.23-30
• /
• 2020

This paper presents a new method for designing a lens system stable against chromatic variation at a specified wavelength. Conventional lenses are corrected for chromatic aberration, but the new method suppresses chromatic changes of the marginal ray in the image-side. By doing so, paraxial properties of the lens system are stabilized against chromatic variation. Since the new method is based on paraxial ray tracing, the stabilizing conditions against chromatic variation are given by recurrence formulas. However, there is an analytic solution for the case of a cemented doublet in the air. A stable doublet at 405 nm wavelength is designed and analyzed.

• Journal of applied mathematics & informatics
• /
• 제18권1_2호
• /
• pp.183-196
• /
• 2005

In this paper we study the chromatic sum functions for rooted nonseparable near-triangular maps on the projective plane. A chromatic sum equation for such maps is obtained.

• 대한수학회논문집
• /
• 제27권4호
• /
• pp.843-849
• /
• 2012

Let G = (V, E) be a graph with chromatic number ${\chi}(G)$. dominating set D of G is called a chromatic transversal dominating set (ctd-set) if D intersects every color class of every ${\chi}$-partition of G. The minimum cardinality of a ctd-set of G is called the chromatic transversal domination number of G and is denoted by ${\gamma}_{ct}$(G). In this paper we characterize the class of trees, unicyclic graphs and cubic graphs for which the chromatic transversal domination number is equal to the connected domination number.

• 한국의류학회지
• /
• 제30권8호
• /
• pp.1222-1233
• /
• 2006

The purpose of this study was to classify the modern image by clothing design elements. This research was done by survey method with 25 kinds of modern image photos selected in fashion magazines. The data was analyzed by Reliability Analysis, Factor Analysis, MANOVA, One-Way ANOVA, Duncan's test and MDS. The results of this study are as follows: 1. modern image was classified by 5 factors. Those were sexy-modern, elegant-modern, natural-modern, mannish-modern and minimal-modern images. 2. Sexy-modern image was well-expressed by chromatic and chromatic color coordinations. Elegant-modern image was well-expressed by fitted silhouette, fit and achromatic and chromatic color coordinations. Natural-modern image was well-expressed by A silhouette, loose apparel-fit, chromatic and chromatic coordinations and soft texture. Mannish-modern image was well-expressed by H silhouette, loose apparel-fit, chromatic and chromatic color coordinations and hard texture. Minimal-modern image was well-expressed by H silhouette, tight or loose apparel-fit and soft texture. 3. modern image was positioned into mostly hard or masculine on image scale.

• Journal of applied mathematics & informatics
• /
• 제42권3호
• /
• pp.511-520
• /
• 2024

In this paper, we introduce the concept of split and non-split tree (D, C)- set of a connected graph G and its associated color variable, namely split tree (D, C) number and non-split tree (D, C) number of G. A subset S ⊆ V of vertices in G is said to be a split tree (D, C) set of G if S is a tree (D, C) set and ⟨V - S⟩ is disconnected. The minimum size of the split tree (D, C) set of G is the split tree (D, C) number of G, γ_χST (G) = min{|S| : S is a split tree (D, C) set}. A subset S ⊆ V of vertices of G is said to be a non-split tree (D, C) set of G if S is a tree (D, C) set and ⟨V - S⟩ is connected and non-split tree (D, C) number of G is γ_χST (G) = min{|S| : S is a non-split tree (D, C) set of G}. The split and non-split tree (D, C) number of some standard graphs and its compliments are identified.

• 호남수학학술지
• /
• 제27권4호
• /
• pp.551-559
• /
• 2005

A permutation graph over a graph G is a generalization of both a graph bundle and a graph covering over G. In this paper, we characterize the F-permutation graphs over a graph whose chromatic numbers are 2. We determine the chromatic numbers of $C_n$-permutation graphs over a tree and the $K_m$-permutation graphs over a cycle.

• Journal of applied mathematics & informatics
• /
• 제15권1_2호
• /
• pp.159-172
• /
• 2004

A map is singular if each edge is on the same face on a surface (i.e., those have only one face on a surface). Because any map with loop is not colorable, all maps here are assumed to be loopless. In this paper po-vides the explicit expression of chromatic sum functions for rooted singular maps on the projective plane, the torus and the Klein bottle. From the explicit expression of chromatic sum functions of such maps, the explicit expression of enumerating functions of such maps are also derived.