JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE) ›› 2022, Vol. 57 ›› Issue (6): 36-43.doi: 10.6040/j.issn.1671-9352.0.2021.330

Previous Articles    

Weighted neighbor toughness of graphs

WENG Ting-ting, WEI Zong-tian   

  1. Department of Mathematics, Xian University of Architecture and Technology, Xian 710055, Shaanxi, China
  • Published:2022-06-10

PDF (PC)

233

Abstract: Introduced neighbor toughness into the weighted graph, and the concept of weighted neighbor toughness of the graph is proposed. On the basis of giving some basic graphs weighted neighbor toughness, the extreme value problem of weighted neighbor toughness of several types of graphs was focused. The results show that the parameter values are related to the structure of the graph, the size of the weights, and the way of weighting, so the invulnerability of the network can be described more accurately.

Key words: network invulnerability, weighted graph, weighted neighbor toughness, toughness

CLC Number: 

  • O157.5
[1] 魏宗田,刘勇,杨威,等.网络抗毁性[M]. 西安:西安交通大学出版社, 2015. WEI Zongtian, LIU Yong, YANG Wei, et al. Network invulnerability[M]. Xian: Xian Jiaotong University Press, 2015.
[2] BONDY J A, MURTY U S R. Graph theory with applications[M]. London: Macmillan Education UK, 1976.
[3] BAUER D, BROERSMA H, SCHMEICHEL E. Toughness in graphs: a survey[J]. Graphs and Combinatorics, 2006, 22(1):1-35.
[4] WU S S Y, COZZENS M B. The minimum size of critically m-neighbour-connected graphs[J]. ARS Combinatoria, 1990, 29:149-160.
[5] 杨静婷. 图的邻域坚韧度研究[D]. 西安: 西安建筑科技大学, 2017. YANG Jingting. A study of vertex neighbor toughness of graphs[D]. Xian: Xian University of Architecture and Technology, 2017.
[6] KATONA G Y, VARGA K. Minimally toughness in special graph classes [J]. Discrete Mathematics, 2018. http://arxiv.org/pdf/1802.00055.pdf.
[7] KATONA G Y, SOLTÉSZ D, VARGA K. Properties of minimally t-tough graphs[J]. Discrete Mathematics, 2018. http://arxiv.org/pdf/1604.02746.pdf.
[8] 马永刚. 图的邻域参数研究 [D]. 大连: 大连海事大学, 2007. MA Yonggang. Research on the neighborhood parameters of graphs [D]. Dalian: Dalian Maritime University, 2007.
[9] 张胜贵,李学良,王力工.通信系统抗破坏能力研究[J]. 西北工业大学学报, 2002, 20(1):100-103. ZHANG Shenggui, LI Xueliang, WANG Ligong. Survivability of communication networks[J]. Journal of Northwestern Polytechnical University, 2002, 20(1):100-103.
[1] SHI Ming, WEI Zong-tian, LIU Yong, WENG Ting-ting. Vertex weighted neighbor tenacity of graphs [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2021, 56(5): 26-32.
[2] Liu-ying WEN,Wei YUAN. Clustering method for multi-label symbolic value partition [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2020, 55(3): 58-69.
[3] CHANG Ren-Ying. A sufficient condition for (a,b,k)-critical graphs [J]. J4, 2010, 45(4): 21-23.
[4] LIU Shu-li. Isolated toughness and existence of fractional (g, f)-factors in graphs [J]. J4, 2010, 45(10): 31-34.
[5] PAN Rui-xia,LAN Mei,LIU Gui-zhen . A condition of isolated toughness on the existence of fractional ［a,b］-factors of graphs [J]. J4, 2008, 43(5): 93-96 .
[6] WANG Bing . Properties of a quasi-claw-free graph [J]. J4, 2007, 42(10): 111-113 .
[7] DI Jian-yan,HOU Jian-feng . [J]. J4, 2006, 41(5): 55-58 .
[8] BIAN Qiu-ju,LI Le-xue . On isolated toughness and fractional (a,b;n)critical graph [J]. J4, 2006, 41(4): 12-14 .
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
Copyright 2018 © Editorial office of JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE)
Supported by Beijing Magtech Co.Ltd