Fuzzy Chordal Graphs and Its Properties
Fuzzy Chordal Graphs and Its Properties
复制标题
模糊弦图及其性质
DOI：
10.1007/s40819-021-00959-x
复制
发表时间：
2021
影响因子：
--
通讯作者：
Kajal De
中科院分区：
文献类型：
--
作者：
Kousik Das;Sovan Samanta;Kajal De
弦图是指每个圈的弦长度大于3的图。对于大型图/网络，通常，弦的数量在数量上小于弦图所需的弦的数量。根据定义，这些图形不是弦。弦图的算法和性质不适用于这种情况。此外，和弦的强度也没有在那里测量。本研究介绍了弦图定义的弦数松弛。引入了模糊强弦的概念。在此基础上，研究了模糊弦图及其相关性质。提出了模糊强弦的测度。同时，作为一个代，模糊k-弦图的发展，并定义了一个模糊弦图上的同构。最后，对模糊弦图的应用领域进行了说明，并给出了一些结论和展望。
Chordal graphs are those graphs which have chords for each cycle of the length > 3. For large graphs/ networks, generally, the number of chords is less in number than the required number of chords to for a chordal graph. By definition, those graphs are not chordal. The algorithms and properties of chordal graphs do not apply to such cases. Also, the strength of the chords is not measured there. This study introduces a relaxation on such number of chords for the definition of chordal graphs. The notion of a fuzzy strong chord is introduced. After that, fuzzy chordal graphs and related properties are developed. The measure of fuzzy strong chords is proposed. Also, as a generation, fuzzy k-chordal graphs are developed, and isomorphism on a fuzzy chordal graph is defined. At last, area of applications of fuzzy chordal graphs and conclusions with future directions are illustrated.