Suppr超能文献

模糊强割点和模糊强割边的一种刻画

A characterization for fuzzy strong cut vertices and fuzzy strong cut edges.

作者信息

Ma Junye, Shen Lijing, Li Lin

机构信息

School of Applied Science, Taiyuan University of Science and Technology, Taiyuan, 030024, People's Republic of China.

School of Mechanical Engineering, Taiyuan University of Science and Technology, Taiyuan, 030024, People's Republic of China.

出版信息

Sci Rep. 2024 Jul 4;14(1):15403. doi: 10.1038/s41598-024-66274-9.

Abstract

Cut vertices and cut edges are valuable for analyzing connectivity problems in classical graph theory. However, they cannot deal with certain fuzzy problems. In order to solve this problem, this paper introduces the definitions of fuzzy strong cut vertices and fuzzy strong cut edges, and characterizes fuzzy strong cut vertices and fuzzy strong cut edges in fuzzy trees, complete fuzzy graphs, and fuzzy cycles. Finally, practical applications verify the effectiveness of the theory in network stability analysis.

摘要

割点和割边对于分析经典图论中的连通性问题很有价值。然而,它们无法处理某些模糊问题。为了解决这个问题,本文引入了模糊强割点和模糊强割边的定义,并刻画了模糊树、完全模糊图和模糊圈中的模糊强割点和模糊强割边。最后,实际应用验证了该理论在网络稳定性分析中的有效性。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9aef/11224279/eba8fed01f66/41598_2024_66274_Fig1_HTML.jpg

相似文献

1
A characterization for fuzzy strong cut vertices and fuzzy strong cut edges.
Sci Rep. 2024 Jul 4;14(1):15403. doi: 10.1038/s41598-024-66274-9.
2
Application of connectivity index of cubic fuzzy graphs for identification of danger zones of tsunami threat.
PLoS One. 2024 Jan 30;19(1):e0297197. doi: 10.1371/journal.pone.0297197. eCollection 2024.
4
Connectivity Concepts in Intuitionistic Fuzzy Incidence Graphs with Application.
Int J Appl Comput Math. 2022;8(5):263. doi: 10.1007/s40819-022-01461-8. Epub 2022 Sep 27.
6
Some isomorphic properties of -polar fuzzy graphs with applications.
Springerplus. 2016 Dec 20;5(1):2104. doi: 10.1186/s40064-016-3783-z. eCollection 2016.
7
A new algorithm to find fuzzy Hamilton cycle in a fuzzy network using adjacency matrix and minimum vertex degree.
Springerplus. 2016 Oct 22;5(1):1854. doi: 10.1186/s40064-016-3473-x. eCollection 2016.
8
Clustering algorithm with strength of connectedness for m-polar fuzzy network models.
Math Biosci Eng. 2022 Jan;19(1):420-455. doi: 10.3934/mbe.2022021. Epub 2021 Nov 16.
9
Intuitionistic fuzzy cycles and intuitionistic fuzzy trees.
ScientificWorldJournal. 2014 Feb 18;2014:305836. doi: 10.1155/2014/305836. eCollection 2014.
10
New concepts of inverse fuzzy mixed graphs and its application.
Granul Comput. 2022;7(3):549-559. doi: 10.1007/s41066-021-00284-0. Epub 2021 Sep 6.

本文引用的文献

1
Estimation of most effected cycles and busiest network route based on complexity function of graph in fuzzy environment.
Artif Intell Rev. 2022;55(6):4557-4574. doi: 10.1007/s10462-021-10111-2. Epub 2022 Jan 10.
2
Clustering algorithm with strength of connectedness for m-polar fuzzy network models.
Math Biosci Eng. 2022 Jan;19(1):420-455. doi: 10.3934/mbe.2022021. Epub 2021 Nov 16.

文献AI研究员

20分钟写一篇综述,助力文献阅读效率提升50倍。

立即体验

用中文搜PubMed

大模型驱动的PubMed中文搜索引擎

马上搜索

文档翻译

学术文献翻译模型,支持多种主流文档格式。

立即体验