JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE) ›› 2023, Vol. 58 ›› Issue (12): 127-133.doi: 10.6040/j.issn.1671-9352.0.2022.324
• • Previous Articles Next Articles
Longmiao XIA(),Zongtian WEI,Liping DING
CLC Number:
1 | 魏宗田, 刘勇, 杨威, 等. 网络抗毁性[M]. 西安: 西安交通大学出版社, 2015. |
WEI Zongtian , LIU Yong , YANG Wei , et al. Network invulnerability[M]. Xi'an: Xi'an Jiaotong University Press, 2015. | |
2 | BONATO A, JANSSEN J, ROSHANBIN E. Burning a graph as a model of social contagion[C]//International Workshop on Algorithms and Models for the Web-Graph, Cham, Switzerland: Springer, 2014: 13-22. |
3 | BONATO A , JANSSEN J , ROSHANBIN E . How to burn a graph[J]. Internet Mathematics, 2016, 12 (1): 85- 100. |
4 | JANSSEN R . The burning number of directed graphs: bounds and computational complexity[J]. Theory and Application of Graphs, 2020, 7 (1): 1- 14. |
5 | BONDY J A , MURTY U S R . Graph theory[M]. London: Springer, 2008. |
6 | 徐俊明. 图论及其应用[M]. 4版 合肥: 中国科学技术大学出版社, 2018. |
XU Junming . Theory and applications of graphs[M]. 4th ed Hefei: University of Science and Technology of China Press, 2018. | |
7 | BOESCH F T , TINDELL A . Circulants and their connectivities[J]. Journal of Graph Theory, 2010, 8, 487- 499. |
8 | 刘振宏, 蔡茂诚. 组合最优化算法和复杂性[M]. 北京: 清华大学出版社, 1988. |
LIU Zhenhong , CAI Maocheng . Combinatorial optimization algorithms and complexity[M]. Beijing: Tsinghua University Press, 1988. |
[1] | WENG Ting-ting, WEI Zong-tian. Weighted neighbor toughness of graphs [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2022, 57(6): 36-43. |
[2] | CUI Chen, WEI Zong-tian. General p-neighbor integrity of graphs [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2022, 57(10): 72-78. |
[3] | 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. |