2-quasitotal fuzzy graphs and their total coloring (Q2036529)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: 2-quasitotal fuzzy graphs and their total coloring |
scientific article; zbMATH DE number 7364595
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 2-quasitotal fuzzy graphs and their total coloring |
scientific article; zbMATH DE number 7364595 |
Statements
2-quasitotal fuzzy graphs and their total coloring (English)
0 references
29 June 2021
0 references
Summary: Coloring of fuzzy graphs has many real-life applications in combinatorial optimization problems like traffic light system, exam scheduling, and register allocation. The coloring of total fuzzy graphs and its applications are well studied. This manuscript discusses the description of 2-quasitotal graph for fuzzy graphs. The proposed concept of 2-quasitotal fuzzy graph is explicated by several numerical examples. Moreover, some theorems related to the properties of 2-quasitotal fuzzy graphs are stated and proved. The results of these theorems are compared with the results obtained from total fuzzy graphs and 1-quasitotal fuzzy graphs. Furthermore, it defines 2-quasitotal coloring of fuzzy total graphs and which is justified.
0 references
0.783381998538971
0 references
0.7794304490089417
0 references