• 제목/요약/키워드: adjacent cycles

검색결과 42건 처리시간 0.02초

THE LINEAR 2-ARBORICITY OF PLANAR GRAPHS WITHOUT ADJACENT SHORT CYCLES

  • Chen, Hong-Yu;Tan, Xiang;Wu, Jian-Liang
    • 대한수학회보
    • /
    • 제49권1호
    • /
    • pp.145-154
    • /
    • 2012
  • Let G be a planar graph with maximum degree $\Delta$. The linear 2-arboricity $la_2$(G) of G is the least integer k such that G can be partitioned into k edge-disjoint forests, whose component trees are paths of length at most 2. In this paper, we prove that (1) $la_2(G){\leq}{\lceil}\frac{\Delta}{2}\rceil+8$ if G has no adjacent 3-cycles; (2) $la_2(G){\leq}{\lceil}\frac{\Delta}{2}\rceil+10$ if G has no adjacent 4-cycles; (3) $la_2(G){\leq}{\lceil}\frac{\Delta}{2}\rceil+6$ if any 3-cycle is not adjacent to a 4-cycle of G.

A SUFFICIENT CONDITION FOR ACYCLIC 5-CHOOSABILITY OF PLANAR GRAPHS WITHOUT 5-CYCLES

  • Sun, Lin
    • 대한수학회보
    • /
    • 제55권2호
    • /
    • pp.415-430
    • /
    • 2018
  • A proper vertex coloring of a graph G is acyclic if G contains no bicolored cycle. A graph G is acyclically L-list colorable if for a given list assignment $L=\{L(v):v{\in}V(G)\}$, there exists an acyclic coloring ${\phi}$ of G such that ${\phi}(v){\in}L(v)$ for all $v{\in}V(G)$ A graph G is acyclically k-choosable if G is acyclically L-list colorable for any list assignment with $L(v){\geq}k$ for all $v{\in}V(G)$. Let G be a planar graph without 5-cycles and adjacent 4-cycles. In this article, we prove that G is acyclically 5-choosable if every vertex v in G is incident with at most one i-cycle, $i {\in}\{6,7\}$.

TOTAL COLORINGS OF PLANAR GRAPHS WITH MAXIMUM DEGREE AT LEAST 7 AND WITHOUT ADJACENT 5-CYCLES

  • Tan, Xiang
    • 대한수학회보
    • /
    • 제53권1호
    • /
    • pp.139-151
    • /
    • 2016
  • A k-total-coloring of a graph G is a coloring of $V{\cup}E$ using k colors such that no two adjacent or incident elements receive the same color. The total chromatic number ${\chi}^{{\prime}{\prime}}(G)$ of G is the smallest integer k such that G has a k-total-coloring. Let G be a planar graph with maximum degree ${\Delta}$. In this paper, it's proved that if ${\Delta}{\geq}7$ and G does not contain adjacent 5-cycles, then the total chromatic number ${\chi}^{{\prime}{\prime}}(G)$ is ${\Delta}+1$.

직물의 표백과 세척이 유연제(DSDMAC) 흡착에 미치는 영향(제2보) (The Effects of Bleaching or Washing on the Absorption of Softener (DSDMAC) (Part 2))

  • 박선경;유효선
    • 한국의류학회지
    • /
    • 제20권5호
    • /
    • pp.711-717
    • /
    • 1996
  • This study was carried to figure out the effect of washing on the cationic surfactant (DSDMAC) absorption by nylon fabrics washed with anionic surfactant(SDBS). Cationic surfactant absorption, static electricity, and fabric stiffness of washed and unwashed nylon fabrics were estimated. And to check the correlation between DSDMAC absorption and SDBS absorption, SDBS absorption by nylon fabrics were measured The results were as follows; 1. Nylon fabrics washed with SDBS absorbed more DSDMAC than unwashed fabrics. The more SDBS absorbed by nylon fabrics, the more DSDMAC absorbed. This is account for the increase in negative zeta potential of washed nylon fabrics. 2. Absorption of SDBS by nylon fabrics increased static electricity. Absorption of DSBMAC by washed and unwashed nylon fabrics greatyl decreased static electricity, and static electricity of washed nylon fabrics more decreased than that of unwashed nylon fabrics. 3. When washing cycles were under 20, DSDMAC absorption decreased fabric stiffness. As washing cycles were over 20, DSDMAC deposited as particles acted as points of weak adhesion between adjacent fibers, so increased the fabric stiffness.

  • PDF

일정응력 및 과대과소응력하에서의 피로크랙 발생전파거동 (Fatigue crack behavior under constant stress and periodic overstressing)

  • 송삼홍;이경노
    • 오토저널
    • /
    • 제13권1호
    • /
    • pp.57-65
    • /
    • 1991
  • It is experimented under rotary bending stress that the spacing of two micro hole flaws is adjacent and that it is distant. In order to observe the behavior of fatigue crack propagation, two kinds of specimens are tested under constant stress and periodic overstressing. Although the crack occurs faster when two micro-hole flaws are adjacent than when they are distant, but there is no difference of the number of fracture cycles between two. The crack propagates slower under low-high block stress than under high-constant stress, and it propagates faster under high-low block stress than under low-constant stress. The influence of two-step block stress is serious right after the stress varies.

  • PDF

Corneal Squamous Cell Carcinoma Presumed to Arise from Corneal Fibrosis in a Shih-Tzu Dog

  • Kim, Eunjik;Park, Youngwoo
    • 한국임상수의학회지
    • /
    • 제35권6호
    • /
    • pp.311-314
    • /
    • 2018
  • Squamous cell carcinoma (SCC) is a form of neoplasm that origins from the epithelial surface of many organs. Ocular occurrence in small animals is rare, especially in the central cornea without the involvement of limbus or conjunctiva. In the current case, a 10-year-old, spayed female Shih-Tzu was presented with a central corneal mass. Through an ophthalmic examination the sign of corneal scarring around the mass was found. Pink fleshy lesion that protruded outward was removed through superficial keratectomy. The mass with the size of $8.5{\times}6.5$ millimeter was histopathologically diagnosed as corneal SCC infiltrating not only the epithelium, but also the superficial corneal stroma with surrounding superficial lymphoplasmacytic and neutrophilic chronic keratitis. Also, the adjacent, non-affected corneal epithelium was markedly hyperplastic and keratinized; the adjacent stroma was moderately vascularized and fibrotic. The pulse-dose therapy using 1% topical 5-flourouracil were applied for five cycles. The tumor has not recurred through nine months of follow-up time.

피라미드 그래프의 헤밀톤 특성 (A Hamiltonian Property of Pyramid Graphs)

  • 장정환
    • 정보처리학회논문지A
    • /
    • 제13A권3호
    • /
    • pp.253-260
    • /
    • 2006
  • 본 논문에서는 피라미드 그래프에서의 헤밀톤 사이클 특성을 분석한다. 사이클 확장 연산을 이용하여 사이클의 크기를 확대시켜 나가는 일련의 과정을 통하여 헤밀톤 사이클을 찾을 수 있는 제시된 알고리즘을 적용함으로써 임의의 높이 N인 피라미드 그래프 내에 길이 $(4^N-1)/3$인 헤밀톤 사이클이 존재함을 증명한다.

Wave Spectrum Based Fatigue Analysis for Mediterranean Sea, Black Sea and Aegean Sea

  • Kabakcioglu, Fuat;Bayraktarkatal, Ertekin
    • International Journal of Ocean System Engineering
    • /
    • 제3권2호
    • /
    • pp.61-67
    • /
    • 2013
  • In this study, wave spectrum based fatigue analyses are studied for Turkey's adjacent coastal seas by using Maestro finite element analyzing software. Palmgren-Miner's method is used to obtain the fatigue safe life time. Palmgren-Miner's method was selected for the fatigue analyses because of its good acceptance of data from almost all classification societies such as Germanischer Lloyd, the American Bureau of Shipping, Det Norske Veritas, etc. The maximum stress regions of the structures are obtained by using finite element analyses, and the results are compared with the endurance limit of the W$\ddot{o}$hler diagram of AA5059 H321 aluminum alloy. The wave characteristics table given in this article is used to obtain the number of cycles for each sea condition. By using the wave characteristics table, the wave lengths, wave speeds, and cycles are obtained. This study is performed to estimate the lifetimes of a semi-swath type coast guard boat and/or commercial yacht projects, which are produced by using AA5059 H321 aluminum alloy, under different sea environment conditions. Fatigue examinations are performed for both head seas and oblique seas.

THE BONDAGE NUMBER OF C3×Cn

  • Sohn, Moo-Young;Xudong, Yuan;Jeong, Hyeon-Seok
    • 대한수학회지
    • /
    • 제44권6호
    • /
    • pp.1213-1231
    • /
    • 2007
  • The domination number ${\gamma}(G)$ of a graph G=(V,E) is the minimum cardinality of a subset of V such that every vertex is either in the set or is adjacent to some vertex in the set. The bondage number of b(G) of a graph G is the cardinality of a smallest set of edges whose removal from G results in a graph with domination number greater than ${\gamma}(G)$. In this paper, we calculate the bondage number of the Cartesian product of cycles $C_3\;and\;C_n$ for all n.

Poly Lactic Acid 섬유의 Vat 염료에 대한 염색견뢰도 (Color Fastness of PLA Fiber Dyed with Vat Dyes)

  • 정동석;천태일
    • 한국염색가공학회지
    • /
    • 제25권1호
    • /
    • pp.75-81
    • /
    • 2013
  • Colorimetric and wash fastness data after repeated wash cycles of Poly Lactic Acid(PLA) fiber were examined with C. I. Vat Blue 1, also other comparing 2 dyes (C. I. Vat Blue 35, C. I. Vat Blue 5), in this study. The fastness of three vat dyes on PLA fiber to repeated washing according to KS K 0430 A-2 regulation increased with dyeing temperatures. The $L^*$ values of the dyed material gradually increased with increasing numbers of wash. Also the f(k) values were decreased reversely. During repeated washing, the vagrant dyes were deposited especially on nylon, polyester, cotton of the adjacent multifiber. C. I. Vat Blue 5 displayed lowest color change to repeated washing of the three dyes used.