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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Ratio mathematica 2022-06, Vol.42, p.115-125
Hauptverfasser:	S Yahya Mohamed, Suganthy, S
Format:	Artikel
Sprache:	eng
Schlagworte:	fuzzy coloring , fuzzy chromatic index , arboricity and span Graph theory Graphs Labeling Matching
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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
DOI:	10.23755/rm.v42i0.710