Fuzzy chromatic polynomial of fuzzy graphs with crisp and fuzzy vertices using -cuts
Summary: Coloring of fuzzy graphs has many real life applications in combinatorial optimization problems like traffic light system, exam scheduling, register allocation, etc. In this paper, the concept of fuzzy chromatic polynomial of fuzzy graph is introduced and defined based on \(\alpha\)-cuts of fuzzy graph. Two different types of fuzziness to fuzzy graph are considered in the paper. The first type was fuzzy graph with crisp vertex set and fuzzy edge set and the second type was fuzzy graph with fuzzy vertex set and fuzzy edge set. Depending on this, the fuzzy chromatic polynomials for some fuzzy graphs are discussed. Some interesting remarks on fuzzy chromatic polynomial of fuzzy graphs have been derived. Further, some results related to the concept are proved. Lastly, fuzzy chromatic polynomials for complete fuzzy graphs and fuzzy cycles are studied and some results are obtained.
- A characterization of fuzzy trees
- A new approach for determining fuzzy chromatic number of fuzzy graph
- A shortest path problem on a network with fuzzy arc lengths
- Bipolar fuzzy graphs
- Chromatic number of fuzzy graphs
- Complement of a fuzzy graph
- Cycles and cocycles of fuzzy graphs
- Fuzzy colouring of fuzzy graphs
- Fuzzy graph theory
- Fuzzy graphs and fuzzy hypergraphs
- Fuzzy sets
- Fuzzy shortest paths
- scientific article; zbMATH DE number 46849 (Why is no real title available?)
- scientific article; zbMATH DE number 3472043 (Why is no real title available?)
- scientific article; zbMATH DE number 3492732 (Why is no real title available?)
- Interval type 2 fuzzy set in fuzzy shortest path problem
- Interval-valued fuzzy graphs
- New concepts on vertex and edge coloring of simple vague graphs
- On automorphisms of fuzzy graphs
- Shortest path problem on a network with imprecise edge weight
- Some remarks on fuzzy graphs
- Strong arcs in fuzzy graphs.
- The fuzzy shortest path problem and its most vital arcs
- Types of arcs in a fuzzy graph
- Vertex-strength of fuzzy graphs
- An uncertain chromatic number of an uncertain graph based on -cut coloring
- 2-quasitotal fuzzy graphs and their total coloring
- Fuzzy chromatic number of union of fuzzy graphs: an algorithm, properties and its application
- Chromatic polynomial of intuitionistic fuzzy graphs using \(\left( \alpha, \beta\right)\)-levels
- Chromatic number of bipolar fuzzy graphs
- Chromatic number of fuzzy graphs
- Vertex-coloring of fuzzy graphs: a new approach
- scientific article; zbMATH DE number 7028336 (Why is no real title available?)
- Applications of edge colouring of fuzzy graphs
- An implementation of coloring of non-disjoint union of fuzzy graphs and fuzzy inference systems to coordinate traffic flows in paired intersections
- Chromatic polynomial of a picture fuzzy graph with application in traffic light control
This page was built for publication: Fuzzy chromatic polynomial of fuzzy graphs with crisp and fuzzy vertices using \(\alpha\)-cuts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2322271)