ISOLATED TOUGHNESS FOR PATH FACTORS IN NETWORKS

被引:25
|
作者
Wang, Sufang [1 ]
Zhang, Wei [2 ]
机构
[1] Jiangsu Univ Sci & Technol, Sch Publ Management, Zhenjiang 212100, Jiangsu, Peoples R China
[2] Wenzhou Univ Technol, Sch Econ & Management, Wenzhou 325000, Zhejiang, Peoples R China
关键词
Graph; isolated toughness; P->= k-factor; P->= k-factor covered graph; (P->=; k; n)-factor-critical covered graph; COMPONENT; EXISTENCE;
D O I
10.1051/ro/2022123
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Let H be a set of connected graphs. Then an H-factor is a spanning subgraph of G, whose every connected component is isomorphic to a member of the set H. An H-factor is called a path factor if every member of the set H is a path. Let k >= 2 be an integer. By a P->= k-factor we mean a path factor in which each component path admits at least k vertices. A graph G is called a (P->= k, n)-factor-critical covered graph if for any W subset of V (G) with |W| = n and any e is an element of E(G - W), G - W has a P->= k-factor covering e. In this article, we verify that (i) an (n + lambda + 2)-connected graph G is a (P->= 2, n)-factor-critical covered graph if its isolated toughness I(G) > n+lambda+2/2 lambda+3 , where n and lambda are two nonnegative integers; (ii) an (n + lambda + 2)-connected graph G is a (P->= 3, n)-factor-critical covered graph if its isolated toughness I(G) > n+3 lambda+5 /2 lambda+3where n and lambda be two nonnegative integers.
引用
收藏
页码:2613 / 2619
页数:7
相关论文
共 50 条
  • [1] TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS
    Zhou, Sizhong
    Wu, Jiancheng
    Xu, Yang
    [J]. BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 2022, 106 (02) : 195 - 202
  • [2] Tight toughness, isolated toughness and binding number bounds for the path factors
    Li, Yue
    Ren, Fengyun
    Xu, Xin
    Tong, Qinghe
    [J]. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS- COMPUTER SYSTEMS THEORY, 2023, 8 (03) : 143 - 151
  • [3] Toughness and isolated toughness conditions for path-factor critical covered graphs
    Dai, Guowei
    [J]. RAIRO-OPERATIONS RESEARCH, 2023, 57 (02) : 847 - 856
  • [4] Isolated toughness and path-factor uniform graphs
    Zhou, Sizhong
    Sun, Zhiren
    Liu, Hongxia
    [J]. RAIRO-OPERATIONS RESEARCH, 2021, 55 (03) : 1279 - 1290
  • [5] Tight Toughness, Isolated Toughness and Binding Number Bounds for the Star-Path Factor
    Yao, Yifan
    Liang, Jinxia
    Li, Yue
    Ma, Rongrong
    [J]. JOURNAL OF INTERCONNECTION NETWORKS, 2024, 24 (03)
  • [6] Isolated toughness and path-factor uniform graphs (II)
    Sizhong Zhou
    Zhiren Sun
    Qiuxiang Bian
    [J]. Indian Journal of Pure and Applied Mathematics, 2023, 54 : 689 - 696
  • [7] Isolated toughness and path-factor uniform graphs (II)
    Zhou, Sizhong
    Sun, Zhiren
    Bian, Qiuxiang
    [J]. INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS, 2023, 54 (03): : 689 - 696
  • [8] Isolated toughness and existence of f-factors
    Ma, Yinghong
    Yu, Qinglin
    [J]. DISCRETE GEOMETRY, COMBINATORICS AND GRAPH THEORY, 2007, 4381 : 120 - +
  • [9] Isolated Toughness and k-Hamiltonian [a, b]-factors
    Zhi-ren SUN
    Si-zhong ZHOU
    [J]. Acta Mathematicae Applicatae Sinica, 2020, 36 (03) : 539 - 544
  • [10] Isolated toughness and fractional (g, f)-factors of graphs
    Ma, Yinghong
    Wang, Aiyun
    Li, JianXiang
    [J]. ARS COMBINATORIA, 2009, 93 : 153 - 160