期刊论文详细信息
Discussiones Mathematicae Graph Theory
A Sufficient Condition for Graphs to Be Super K-Restricted Edge Connected
Wang Shiying1  Wang Meiyu2  Zhang Lei3 
[1] College of Mathematics and Information Science, Engineering Laboratory for Big Data Statistical Analysis and Optimal Control, Henan Normal University, Xinxiang, Henan 453007, P.R. China;School of Mathematical Sciences, Shanxi University, Taiyuan, Shanxi 030006, P.R. China;School of Mathematics, Jinzhong University, Jinzhong, Shanxi 030600, P.R. China;
关键词: graph;    neighborhood;    k-restricted edge connectivity;    super k-restricted edge connected graph;    05c40;   
DOI  :  10.7151/dmgt.1939
来源: DOAJ
【 授权许可】

Unknown   

  文献评价指标  
  下载次数:0次 浏览次数:0次