• 제목/요약/키워드: [a, b]-factor

검색결과 5,565건 처리시간 0.044초

MINIMUM DEGREE AND INDEPENDENCE NUMBER FOR THE EXISTENCE OF HAMILTONIAN [a, b]-FACTORS

  • Zhou, Sizhong;Pu, Bingyuan
    • Journal of applied mathematics & informatics
    • /
    • 제28권1_2호
    • /
    • pp.325-331
    • /
    • 2010
  • Let a and b be nonnegative integers with 2 $\leq$ a < b, and let G be a Hamiltonian graph of order n with n > $\frac{(a+b-5)(a+b-3)}{b-2}$. An [a, b]-factor F of G is called a Hamiltonian [a, b]-factor if F contains a Hamiltonian cycle. In this paper, it is proved that G has a Hamiltonian [a, b]-factor if $\delta(G)\;\geq\;\frac{(a-1)n+a+b-3)}{a+b-3}$ and $\delta(G)$ > $\frac{(a-2)n+2{\alpha}(G)-1)}{a+b-4}$.

SHARP CONDITIONS FOR THE EXISTENCE OF AN EVEN [a, b]-FACTOR IN A GRAPH

  • Cho, Eun-Kyung;Hyun, Jong Yoon;O, Suil;Park, Jeong Rye
    • 대한수학회보
    • /
    • 제58권1호
    • /
    • pp.31-46
    • /
    • 2021
  • Let a and b be positive integers, and let V (G), ��(G), and ��2(G) be the vertex set of a graph G, the minimum degree of G, and the minimum degree sum of two non-adjacent vertices in V (G), respectively. An even [a, b]-factor of a graph G is a spanning subgraph H such that for every vertex v ∈ V (G), dH(v) is even and a ≤ dH(v) ≤ b, where dH(v) is the degree of v in H. Matsuda conjectured that if G is an n-vertex 2-edge-connected graph such that $n{\geq}2a+b+{\frac{a^2-3a}{b}}-2$, ��(G) ≥ a, and ${\sigma}_2(G){\geq}{\frac{2an}{a+b}}$, then G has an even [a, b]-factor. In this paper, we provide counterexamples, which are highly connected. Furthermore, we give sharp sufficient conditions for a graph to have an even [a, b]-factor. For even an, we conjecture a lower bound for the largest eigenvalue in an n-vertex graph to have an [a, b]-factor.

B2B e-marketplace의 참여도에 영향을 미치는 요인에 관한 연구 - 구매자와 공급자의 측면에서-* (An empirical study on the factors affecting the participation of B2B e-marketplace: from a perspective of buyers and sellers.)

  • 김상수;강영구
    • Journal of Information Technology Applications and Management
    • /
    • 제9권4호
    • /
    • pp.179-204
    • /
    • 2002
  • The purpose of this study is to empirically Investigate the critical success factors affecting the participation of B2B e-marketplace from a perspective of buyers and sellers. The research model presented in this study suggests that the success of B2B e-marketplace depends on the degree of participation of buyers and sellers. It is hypothesized that the participation of buyers and sellers is related with several contextual factors. The contextual factors included: (a) industry and market factor; (b) Internal environment factor; (c) product factor; (d) Inter-organizational factor; and (e) B2B e-marketplace system and strategy factor. An analysis of data from 31 buyer firms and 31 seller firms reveals that those five factors have a significant effect on the participation and success of B2B e-marketplace. The implications of the study are discussed and further research directions are proposed.

  • PDF

SHARP ORE-TYPE CONDITIONS FOR THE EXISTENCE OF AN EVEN [4, b]-FACTOR IN A GRAPH

  • Cho, Eun-Kyung;Kwon, Su-Ah;O, Suil
    • 대한수학회지
    • /
    • 제59권4호
    • /
    • pp.757-774
    • /
    • 2022
  • Let a and b be positive even integers. An even [a, b]-factor of a graph G is a spanning subgraph H such that for every vertex v ∈ V (G), dH(v) is even and a ≤ dH(v) ≤ b. Let κ(G) be the minimum size of a vertex set S such that G - S is disconnected or one vertex, and let σ2(G) = minuv∉E(G) (d(u)+d(v)). In 2005, Matsuda proved an Ore-type condition for an n-vertex graph satisfying certain properties to guarantee the existence of an even [2, b]-factor. In this paper, we prove that for an even positive integer b with b ≥ 6, if G is an n-vertex graph such that n ≥ b + 5, κ(G) ≥ 4, and σ2(G) ≥ ${\frac{8n}{b+4}}$, then G contains an even [4, b]-factor; each condition on n, κ(G), and σ2(G) is sharp.

BINDING NUMBER AND HAMILTONIAN (g, f)-FACTORS IN GRAPHS

  • Cai, Jiansheng;Liu, Guizhen
    • Journal of applied mathematics & informatics
    • /
    • 제25권1_2호
    • /
    • pp.383-388
    • /
    • 2007
  • A (g, f)-factor F of a graph G is Called a Hamiltonian (g, f)-factor if F contains a Hamiltonian cycle. The binding number of G is defined by $bind(G)\;=\;{min}\;\{\;{\frac{{\mid}N_GX{\mid}}{{\mid}X{\mid}}}\;{\mid}\;{\emptyset}\;{\neq}\;X\;{\subset}\;V(G)},\;{N_G(X)\;{\neq}\;V(G)}\;\}$. Let G be a connected graph, and let a and b be integers such that $4\;{\leq}\;a\;<\;b$. Let g, f be positive integer-valued functions defined on V(G) such that $a\;{\leq}\;g(x)\;<\;f(x)\;{\leq}\;b$ for every $x\;{\in}\;V(G)$. In this paper, it is proved that if $bind(G)\;{\geq}\;{\frac{(a+b-5)(n-1)}{(a-2)n-3(a+b-5)},}\;{\nu}(G)\;{\geq}\;{\frac{(a+b-5)^2}{a-2}}$ and for any nonempty independent subset X of V(G), ${\mid}\;N_{G}(X)\;{\mid}\;{\geq}\;{\frac{(b-3)n+(2a+2b-9){\mid}X{\mid}}{a+b-5}}$, then G has a Hamiltonian (g, f)-factor.

실험설계 유형별 Venn Diagram을 이용한 EMS 도출 (Derivation of Expected Mean Squares (EMS) Using Venn Diagram by the Type of Experimental Design)

  • 최성운
    • 대한안전경영과학회:학술대회논문집
    • /
    • 대한안전경영과학회 2011년도 춘계학술대회
    • /
    • pp.695-699
    • /
    • 2011
  • The study presents an efficient design method of Venn Diagram that can be used when implementing the quality design of experiments based on generalizability theory. The paper examines four mixed and combined models that are designed by fixed factor, random factor, crossed factor and nested factor. The models considered in this research are $A^*{\times}B^*{\times}C$, (B: $A^*$)${\times}C$, $A{\times}B{\times}C$ and (B: A)${\times}C$.

  • PDF

Sulforaphane Inhibits Osteoclastogenesis by Inhibiting Nuclear Factor-κB

  • Kim, Soo-Jin;Kang, So-Young;Shin, Hyun-Hee;Choi, Hye-Seon
    • Molecules and Cells
    • /
    • 제20권3호
    • /
    • pp.364-370
    • /
    • 2005
  • We show that sulforaphane inhibits osteoclastogenesis in the presence of macrophage colony-stimulating factor (M-CSF) and receptor for activation of nuclear factor-${\kappa}B$ ligand (RANKL) in osteoclast (OC) precursors. Sulforaphane, an aliphatic isothiocyanate, is a known cancer chemo-preventative agent with anti-oxidative properties. Nuclear factor-${\kappa}B$ (NF-${\kappa}B$) is a critical transcription factor in RANKL-induced osteoclastogenesis, and electrophoretic mobility shift assays (EMSAs) and assay of NF-${\kappa}B$-mediated secreted alkaline phosphatase (SEAP) revealed that sulforaphane selectively inhibited NF-${\kappa}B$ activation induced by RANKL. Inhibition may involve interaction of sulforaphane with thiol groups, since it was prevented by reducing agents.

Role of PI3-Kinase/Akt Pathway in the Activation of Etoposide-Induced $NF-{\kappa}B$ Transcription Factor

  • Choi Yong-Seok;Park Heon-Yong;Jeong Sun-Joo
    • Journal of Microbiology and Biotechnology
    • /
    • 제16권3호
    • /
    • pp.391-398
    • /
    • 2006
  • $NF-{\kappa}B$ is a transcription factor involved in the innate immunity against bacterial infection and inflammation. It is also known to render cells resistant to the apoptosis caused by some anticancer drugs. Such a chemoresistance of cancer cells may be related to the activation of $NF-{\kappa}B$ transcription factor; however, the mechanism of activation is not well understood. Here, we demonstrate that a chemotherapeutic agent, etoposide, independently stimulates the $I{\kappa}B{\alpha}$ degradation pathway and PI3-kinase/Akt signaling pathway: The classical $I{\kappa}B{\alpha}$ degradation pathway leads to the nuclear translocation and DNA binding of p65 subunit through $IKK{\beta}$ kinase, whereas the PI3-kinase/Akt pathway plays a distinct role in activating this transcription factor. The PI3-kinase/Akt pathway acts on the p50 subunit of the $NF-{\kappa}B$ transcription factor and enhances the DNA binding affinity of the p50 protein. It may also explain the role of the PI3-kinase/Akt pathway in the anti-apoptotic function of $NF-{\kappa}B$ during chemoresistance of cancer cells.

BINDING NUMBER CONDITIONS FOR (a, b, k)-CRITICAL GRAPHS

  • Zhou, Sizhong
    • 대한수학회보
    • /
    • 제45권1호
    • /
    • pp.53-57
    • /
    • 2008
  • Let G be a graph, and let a, b, k be integers with $0{\leq}a{\leq}b,k\geq0$. Then graph G is called an (a, b, k)-critical graph if after deleting any k vertices of G the remaining graph of G has an [a, b]-factor. In this paper, the relationship between binding number bind(G) and (a, b, k)-critical graph is discussed, and a binding number condition for a graph to be (a, b, k)-critical is given.

B2B e-마켓플레이스의 e-CRM요인이 고객관계의 질과 성과에 미치는 영향 -전환장벽의 조절효과를 중심으로- (The Effect of e-CRM Factors on Customer Relationship Quality and Performance in B2B e-Marketplace -Focused on Moderating Effects of Switching Barriers)

  • 송선옥;박규영
    • 통상정보연구
    • /
    • 제13권4호
    • /
    • pp.23-49
    • /
    • 2011
  • 본 연구는 고객관계관리의 중요성과 비중이 높아짐에 따라 B2B e-마켓플레이스에서의 e-CRM요인이 고객관계의 질과 성과에 미치는 영향관계를 파악하고 이러한 영향관계에서 전환장벽이 조절효과를 가지는지를 기업 대상 설문조사 자료를 토대로 실증분석 하였다. 분석결과를 살펴보면 첫째, e-CRM 요인 (e-Marketing, e-Service, e-Sales)은 B2B e-마켓플레이스 이용 고객들(공급자/구매자)과의 관계의 질(만족, 신뢰)과 성과(재구매 의도, 장기지향성)에 유의한 정(+)의 영향을 미쳤다. 둘째, 고객관계의 질과 성과 간의 분석에서는 관계의 질이 높을수록 성과도 높아지는 긍정적 관계를 나타냈다. 셋째, 고객관계의 질과 성과간의 관계에서 전환장벽(대안 매력도, 전환비용)의 조절효과 분석에서는 대안매력도와 전환비용은 모두 정(+)의 조절효과를 보였다.

  • PDF