Arboricity and span in fuzzy chromatic index
A fuzzy matching is a set of edges in which an edge does not incident on a vertex with same membership value. If every vertex of fuzzy graph is M-Plunged then the fuzzy matching is called as fair fuzzy matching. In this chapter, fuzzy coloring and fuzzy chromatic index are defined. The concept of Ar...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Accademia Piceno Aprutina dei Velati
2022-06-01
|
| Series: | Ratio Mathematica |
| Subjects: | |
| Online Access: | http://eiris.it/ojs/index.php/ratiomathematica/article/view/710 |
| Summary: | A fuzzy matching is a set of edges in which an edge does not incident on a vertex with same membership value. If every vertex of fuzzy graph is M-Plunged then the fuzzy matching is called as fair fuzzy matching. In this chapter, fuzzy coloring and fuzzy chromatic index are defined. The concept of Arboricity and span in fuzzy chromatic index are discussed in detail. Some theorems based on these concepts are proved. |
|---|---|
| ISSN: | 1592-7415 2282-8214 |