Ore type sufficient condition for a graph to be super restricted edge-connected

被引:0
|
作者
Wang, Ying-Qian [1 ]
Li, Qiao [1 ]
机构
[1] Dept. of Appl. Math., Shanghai Jiaotong Univ., Shanghai 200030, China
关键词
Restricted edge connected - Restricted edge connectivity;
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
页码:1253 / 1255
相关论文
共 50 条
  • [31] Sufficient conditions for bipartite graphs to be super-k-restricted edge connected
    Yuan, Jun
    Liu, Aixia
    Wang, Shiying
    DISCRETE MATHEMATICS, 2009, 309 (09) : 2886 - 2896
  • [32] Super-cyclically edge-connected regular graphs
    Jin-Xin Zhou
    Yan-Quan Feng
    Journal of Combinatorial Optimization, 2013, 26 : 393 - 411
  • [33] Sufficient conditions for maximally edge-connected graphs and arc-connected digraphs
    Wang, Shiying
    Zhang, Guozhen
    Wang, Xiuli
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2011, 50 : 233 - 242
  • [34] A Sufficient Condition of Hamilton Connected Graph
    YIN Zhi-xiang 1
    2.Department of Mathematics and Physics
    Chinese Quarterly Journal of Mathematics, 2003, (01) : 99 - 102
  • [35] Edge-Connected Jaccard Similarity for Graph Link Prediction on FPGA
    Sathre, Paul
    Gondhalekar, Atharva
    Feng, Wu-Chun
    2022 IEEE High Performance Extreme Computing Conference, HPEC 2022, 2022,
  • [36] On forcibly k-edge-connected and forcibly super edge-connected uniform hypergraphic sequences
    Liu, Xuemei
    Meng, Jixiang
    Tian, Yingzhi
    JOURNAL OF SUPERCOMPUTING, 2023, 79 (14): : 15980 - 15996
  • [37] On forcibly k-edge-connected and forcibly super edge-connected uniform hypergraphic sequences
    Xuemei Liu
    Jixiang Meng
    Yingzhi Tian
    The Journal of Supercomputing, 2023, 79 : 15980 - 15996
  • [38] Edge-Connected Jaccard Similarity for Graph Link Prediction on FPGA
    Sathre, Paul
    Gondhalekar, Atharva
    Feng, Wu-chun
    2022 IEEE HIGH PERFORMANCE EXTREME COMPUTING VIRTUAL CONFERENCE (HPEC), 2022,
  • [39] Sufficient conditions for maximally restricted edge connected graphs
    Qin, Yingying
    Ou, Jianping
    DISCRETE MATHEMATICS, 2012, 312 (19) : 2969 - 2972
  • [40] A necessary and sufficient condition for a graph to be edge tenacious
    Wang, ZP
    Zhao, LC
    DISCRETE MATHEMATICS, 2001, 234 (1-3) : 191 - 197