An implementation of coloring of non-disjoint union of fuzzy graphs and fuzzy inference systems to coordinate traffic flows in paired intersections

Rosyida, Isnaini; Wiyanti, Dian Tri; Safa'atullah, Muhammad Fajar; Narendra, Alfa; Nurhaida,

doi:10.1016/j.fss.2022.05.017

Cited by 2 publications

(2 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Definition 7 (see [22]). A Sugeno-Type Fuzzy (STF) graph of a fuzzy graph G is a proper fuzzy colouring in which each node of G dominates every node in some colour class.…”

Section: Coloring Theorems: Sugeno-type Fuzzy Graph Theorymentioning

confidence: 99%

An Extensive Study on Graph Colourings and Dominator Chromatic Number of Sugeno-Type Fuzzy Graphs

Devi

2022

Mathematical Problems in Engineering

View full text Add to dashboard Cite

The concept of graph colouring has become a very active field of research that enhances many practical applications and theoretical challenges. An accurate (vertex) colouring through the condition that each vertex is whichever unaccompanied in its colour class or adjoining to all vertices of at least one colour class is known as dominator colouring. A graph is dominator colouring is a suitable colouring in which at least one vertex dominates each colour class. Many difficult and global issues are solved using fuzzy graph colouring approaches. In this paper, we introduce a new Sugeno-Type Fuzzy graph of groups, which is found using several fuzzy graph operations such as dominant path-colouring number, cycle, union, join, and products. A number that is representative based on those vertices in the formations of all paths with those vertices as their starts and ends to compare with other paths is the minimum number of shared edges based on those vertices in the formations of all paths with those vertices as their starts and ends to compare with other paths. The sugeno dominant path-colouring number is the minimum Sugeno number of shared edges among the Sugeno cardinality of all sets of shared edges, which allows for various techniques. These results are used in studying various and recently introduced chromatic numbers of graphs.

show abstract

“…Definition 7 (see [22]). A Sugeno-Type Fuzzy (STF) graph of a fuzzy graph G is a proper fuzzy colouring in which each node of G dominates every node in some colour class.…”

Section: Coloring Theorems: Sugeno-type Fuzzy Graph Theorymentioning

confidence: 99%

An Extensive Study on Graph Colourings and Dominator Chromatic Number of Sugeno-Type Fuzzy Graphs

Devi

2022

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…A new approach was proposed by Rosyida et al [4] for determining fuzzy δ-chromatic number and some properties of the fuzzy chromatic set of fuzzy graph were investigated. And finally Rosyida et al [5] have extended the idea of fuzzy chromatic number (FCN) for the non-disjoint union of two fuzzy graphs and implemented coloring of non-disjoint union of fuzzy graphs and fuzzy inference systems to coordinate traffic flows in paired intersections.…”

Section: Introductionmentioning

confidence: 99%

Method for Finding the Chromatic Number of Intuitionistic Fuzzy Graph

Bozhenyuk,

Belyakov,

Knyazeva

2023

View full text Add to dashboard Cite

In this paper a method for determining the chromatic number and the problem of fuzzy graph coloring is discussed. The problem of attributing colors to predetermined elements of a graph with respect to certain restrictions and constraints under uncertainty in considered. The process of vertex coloring in crisp graph presupposes that no two adjacent vertices have the same color, so the concept of chromatic number in graph defines the minimum number of colors that we may need to color the graph. The concept of a chromatic number search of fuzzy graph is extended to intuitionistic case in this paper. The chromatic number as an intuitionistic fuzzy set determines the greatest degree of separability of the vertices of the graph when it is colored with a given number of colors. A method for determining the chromatic number is proposed and the algorithm for determining a chromatic number is considered as well.

show abstract

An implementation of coloring of non-disjoint union of fuzzy graphs and fuzzy inference systems to coordinate traffic flows in paired intersections

Cited by 2 publications

References 23 publications

An Extensive Study on Graph Colourings and Dominator Chromatic Number of Sugeno-Type Fuzzy Graphs

An Extensive Study on Graph Colourings and Dominator Chromatic Number of Sugeno-Type Fuzzy Graphs

Method for Finding the Chromatic Number of Intuitionistic Fuzzy Graph

Contact Info

Product

Resources

About