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: | S. Yahya Mohamed, S. Suganthy |
---|---|
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 |
Similar Items
-
Application of maple on computing strong fuzzy chromatic polynomial of fuzzy graphs
by: Mamo Abebe Ashebo, et al.
Published: (2022-11-01) -
Chromatic Number of Fuzzy Graphs: Operations, Fuzzy Graph Coloring, and Applications
by: Zengtai Gong, et al.
Published: (2022-12-01) -
Chromatic Number of Resultant of Fuzzy Graphs
by: Anjaly Kishore, et al.
Published: (2016-06-01) -
The chromatic distinguishing index of certain graphs
by: Saeid Alikhani, et al.
Published: (2020-01-01) -
Bounds On Fuzzy Dominator Chromatic Number of Fuzzy Soft Bipartite Graphs
by: Jahir Hussain R, et al.
Published: (2023-03-01)