Abstract
In fuzzy graph theory, strong arcs have separate importance. Assign different colors to the end nodes of strong arcs in the fuzzy graph is strong coloring. Strong coloring plays an important role in solving real-life problems that involve networks. In this work, we introduce the new concept, called strong fuzzy chromatic polynomial (SFCP) of a fuzzy graph based on strong coloring. The SFCP of a fuzzy graph counts the number of <i>k</i>-strong colorings of a fuzzy graph with <i>k</i> colors. The existing methods for determining the chromatic polynomial of the crisp graph are used to obtain SFCP of a fuzzy graph. We establish the necessary and sufficient condition for SFCP of a fuzzy graph to be the chromatic polynomial of its underlying crisp graph. Further, we study SFCP of some fuzzy graph structures, namely strong fuzzy graphs, complete fuzzy graphs, fuzzy cycles, and fuzzy trees. Besides, we obtain relations between SFCP and fuzzy chromatic polynomial of strong fuzzy graphs, complete fuzzy graphs, and fuzzy cycles. Finally, we present dual applications of the proposed work in the traffic flow problem. Once SFCP of a fuzzy graph is obtained, the proposed approach is simple enough and shortcut technique to solve strong coloring problems without using coloring algorithms.
Highlights
Fuzzy graph theory is a dominant concept for modeling and solving combinatorial optimization problems which come from different fields
In this article, we present the definition of strong fuzzy chromatic polynomial (SFCP) of a fuzzy graph based on strong coloring
We have introduced the concept of the strong fuzzy chromatic polynomial of fuzzy graphs and we have defined SFCP of fuzzy graph based on the strong coloring of a fuzzy graph
Summary
Fuzzy graph theory is a dominant concept for modeling and solving combinatorial optimization problems which come from different fields. Bhutani [3] introduced the concept of automorphisms of fuzzy graphs and defined a complete fuzzy graph. Many researchers have actively worked on advancing fuzzy graphs [9,10,11,12,13] They have studied fuzzy graph structures including strong, complete, regular fuzzy graph structures [14,15,16]. In this article, we present the definition of SFCP of a fuzzy graph based on strong coloring. We obtain relations between SFCP and fuzzy chromatic polynomial of strong fuzzy graphs, complete fuzzy graphs, and fuzzy cycles. V. We present the definition of a strong fuzzy chromatic number of a fuzzy graph in terms of SFCP. We suggest SFCP approach to solve strong coloring problems
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
