STRONG EDGE COLORING OF A COMPLEMENT FUZZY GRAPH BASED ON β CUT
S.AMSATH
, DR.N.A.P.ARUL PANDIAN , R.CHANDRA DEVI
Complement fuzzy graph, edge color, β cut of fuzzy graph
Graph coloring is one of the most important problems of combinatorial optimization. Many problems of practical interest can be modeled as coloring problems. Two types of coloring namely vertex coloring and edge coloring are usually associated with any graph. Edge coloring is a function which assigns colors to the edges so that incident edges receive different colors. Let G=(V,µ,𝜎) be a simple connected undirected graph where V is a set of vertices and each vertices has a membership value µ and each edge has a membership value 𝜎 . Minimum number of color needed to color the graph is known as chromatic number of that graph. Graph coloring is a NP complete problem. In our paper, we introduce an algorithm to find the complement of any fuzzy graph with O(n2 ) time and also coloring this complement fuzzy graph using β cut.
"STRONG EDGE COLORING OF A COMPLEMENT FUZZY GRAPH BASED ON β CUT", IJNRD - INTERNATIONAL JOURNAL OF NOVEL RESEARCH AND DEVELOPMENT (www.IJNRD.org), ISSN:2456-4184, Vol.8, Issue 3, page no.c334-c351, March-2023, Available :https://ijnrd.org/papers/IJNRD2303244.pdf
Volume 8
Issue 3,
March-2023
Pages : c334-c351
Paper Reg. ID: IJNRD_188974
Published Paper Id: IJNRD2303244
Downloads: 000118845
Research Area: Engineering
Country: -, -, -
ISSN: 2456-4184 | IMPACT FACTOR: 8.76 Calculated By Google Scholar | ESTD YEAR: 2016
An International Scholarly Open Access Journal, Peer-Reviewed, Refereed Journal Impact Factor 8.76 Calculate by Google Scholar and Semantic Scholar | AI-Powered Research Tool, Multidisciplinary, Monthly, Multilanguage Journal Indexing in All Major Database & Metadata, Citation Generator
Publisher: IJNRD (IJ Publication) Janvi Wave
