- Research note
- Open Access
- Published:

# Application of maple on computing strong fuzzy chromatic polynomial of fuzzy graphs

*BMC Research Notes*
**volume 15**, Article number: 344 (2022)

## Abstract

### Objective

In the field of graph theory, maple is a technical computation form that is used for solving problems. In this article, we apply maple to find the strong fuzzy chromatic polynomial of fuzzy graphs and related. Moreover, we apply maple to obtain strong fuzzy chromatic numbers of fuzzy graphs using their strong fuzzy chromatic polynomials.

### Results

The strong fuzzy chromatic polynomials for fuzzy graphs, strong fuzzy graphs and complete fuzzy graphs are determined using maple. Furthermore, the strong fuzzy chromatic numbers for the fuzzy graphs are obtained.

## Introduction

A graph is a convenient way of representing information involving relationship between objects. The objects are represented by vertices and relations by edges. To handle the uncertainty and incompleteness in the description of the objects or in its relationships or in both, Zadeh [1] introduced a fuzzy set theory. Rosenfeld [2] developed the theory of fuzzy graph based on Zadeh’s fuzzy set and fuzzy relations. After that, several scholars introduced many concepts in the fuzzy graph theory [3,4,5,6,7,8,9,10,11,12]. Mathematical tools play a vital role in solving real-world problems. Fuzzy coloring is very useful tools for solving many problems including traffic light problems [13,14,15,16]. Numerous researchers published their work on the fuzzy coloring and related concepts [17,18,19]. Based on strong arcs, the concept of strong coloring of fuzzy graphs has been introduced by Kishore and Sunitha [20]. In recent times, the notion of fuzzy chromatic polynomial and its properties [21, 22] and the notion of strong fuzzy chromatic polynomial of fuzzy graphs [23] have been studied by scholars.

Maple’s Graph Theory package was developed by a group of graduate students and faculty at Simon Fraser University under the direction of Michael Monagan starting 2004. The design of the package was first presented at the 2005 Maple conference in Waterloo in the summer of 2005. New commands and improvements, in particular to facilities for drawing graphs, were presented at the 2006 Maple conference [24, 25]. The first version of the package was released in Maple 11 in 2007 as the Graph Theory package. The package supports simple undirected graphs and simple directed graphs, both of which may be weighted.

A few operations of graphs like fuzzy graph, wiener index of graph, cluster and corona operations of graph, total graph, semi-total line and edge join of graphs have been valuable in graph theory and chemical graph theory to consider the properties of boiling point, heat of evaporation, surface tension, vapor pressure, total electron energy of polymers, partition coefficients, ultrasonic sound velocity and internal energy. Monte Carlo simulation technique is used in survival signature to analyze the fuzzy reliability of systems having complexity [26,27,28,29,30,31]. The degree sequence of a graph and algebraic structure of different graphs operations were determined and its result is to the join and corona products of any number of graphs.

For the notations not declared in this manuscript, to understand well we recommend the readers to refer [32,33,34,35,36]

In this article, we apply maple to find the strong fuzzy chromatic polynomials of fuzzy graphs including strong and complete fuzzy graphs. Moreover, we obtain the strong fuzzy chromatic number for fuzzy graphs based on their strong fuzzy chromatic polynomials.

## Main text

### Method

### Definition 1

[23] Let \(G\) be a fuzzy graph with a positive integer \(k\), the number of distinct \(k\)-strong colorings of \(G\) is called strong fuzzy chromatic polynomial (SFCP) of \(G\).

It is denoted by \({P}_{s}^{f}\left(G,k\right)\).

For a fuzzy graph \(G\), \({P}_{s}^{f}\left(G,k\right)=P({G}^{*},k)\) iff all the arcs in \(G\) are strong or \({P}_{s}^{f}\left(G,k\right)=P({H}^{*},k)\) if \(G\) has at least one \(\delta \)-arc and \(H=G-\left\{\delta -arcs\right\}.\) Here, we observed that the strong fuzzy chromatic polynomials of fuzzy graphs \(G\) are determined in terms of the chromatic polynomial of crisp graphs \({G}^{*}\) or \({H}^{*}\).

### Theorem 1

[23] Let \(G\) be a strong fuzzy graph and \({G}^{*}\) be its underlying crisp graph. Then \({P}_{s}^{f}\left(G,k\right)=P\left({G}^{*},k\right).\)

### Theorem 2

[23] Let \(G\) be a complete fuzzy graph with* n* vertices*.* Then \({P}_{s}^{f}\left(G,k\right)=P\left({K}_{n}, k\right),\) where \({K}_{n}\) is a complete crisp graph with* n* vertices.

### Strong fuzzy chromatic polynomial by maple

In this article, for computing the chromatic polynomial of a crisp graph, we use Maple 18 which was released in 2014. In the Graph Theory package, the chromatic polynomial of a crisp graph is determined by using a Maple command, called “*P:* = *ChromaticPolynomial(G,k)*”.

### Example 1

Find the strong fuzzy chromatic polynomial the fuzzy graphs in Fig. 1 by Maple.

**Solution:** For the fuzzy graph \(G\) in Fig. 1, \({P}_{s}^{f}\left(G,k\right)=P({H}^{*},k)\), where \(H=G-\left\{\left(v,w\right), (v,x)\right\}\). Thus, to compute, \(P({H}^{*},k)\), we will give it by the following steps of Maple commands in Maple 18.

> *with(GraphTheory):*

> \({H}^{*}\): = *Graph([u,v,w,x]*,

*{{u,v},{u,w},{u,x},{x,w}}):*

* > DrawGraph(*
\({H}^{*}\)
*, style = circle):*

* > P: = ChromaticPolynomial(*
\({H}^{*}\)
*, k)*

Therefore, \({P}_{s}^{f}\left(G,k\right)=k{\left(k-1\right)}^{2}(k-2)\).

### Example 2

Determine the strong fuzzy chromatic polynomials of the fuzzy graphs in Fig. 2 and 3 using Maple.

**Solution**: Since the fuzzy graph in Fig. 2 is strong, by Theorem 1\({P}_{s}^{f}\left(G,k\right)=P\left({G}^{*},k\right).\) Therefore, to compute, \(P({G}^{*},k)\), we will give it by the following steps of Maple commands in Maple 18.

> *with(GraphTheory):*

> \({G}^{*}\): = *Graph([u,v,w,x,y], {{u,v},{v,w},{w,x},{x,y},{y,u}}):*

> *DrawGraph(*\({G}^{*}\)*, style* = *circle):*

> *P:* = *ChromaticPolynomial(*\({G}^{*}\)*,k)*

Hence*, *\({{P}_{s}^{f}\left(G,k\right)=\left(k-1\right)}^{5}-k+1\)*.*

Similarly, since the fuzzy graph in Fig. 3 is complete, by Theorem 2\({P}_{s}^{f}\left(G,k\right)=P\left({K}_{4},k\right).\) Therefore, to compute, \(P({K}_{4},k)\), we will give it by the following steps of Maple commands in Maple 18.

> *with(GraphTheory):*

> *with(SpecialGraphs):*

> *G:* = *CompleteGraph(4):*

> *DrawGraph(G, style* = *planar):*

> *P:* = *ChromaticPolynomial(G,k)*

Thus*,*\({P}_{s}^{f}\left(G,k\right)=k\left(k-1\right)\left(k-2\right)(k-3)\).

### Strong fuzzy chromatic number by maple

Besides counting of the number of strong colorings on fuzzy graphs, the strong fuzzy chromatic polynomials can be used to obtain strong fuzzy chromatic number of a fuzzy graph.

The following definition finds the strong fuzzy chromatic number, \({\chi }_{s}^{f}(G)\) from the strong fuzzy chromatic polynomial \({P}_{s}^{f}\left(G,k\right).\)

### Definition 2

[23] Let \(G\) be a fuzzy graph*.* The number \(k\) is called the strong fuzzy chromatic number of \(G\) if there exist the smallest positive integer \(k\) such that \({P}_{s}^{f}\left(G,k\right)\ne 0.\) In this case, \(k={\chi }_{s}^{f}(G)\).

Maple tools can be used for finding the strong fuzzy chromatic number of a fuzzy graph, \({\chi }_{s}^{f}\left(G\right)\). To find \({\chi }_{s}^{f}\left(G\right)\) we use a Maple command, called “*eval(P, k)*”, which means evaluate the chromatic polynomial \(P\) at positive integer \(k\). Finally, by using Definition 2 we obtain \({\chi }_{s}^{f}\left(G\right)\). The situation is illustrated by numerical examples.

### Example 2

Consider the fuzzy graph in Fig. 1. Find \({\chi }_{s}^{f}\left(G\right)\) by Maple.

**Solution**: First, consider the fuzzy graph \(G\) in Fig. 1., the Maple commands to find \({\chi }_{s}^{f}\left(G\right)\) are

> *with(GraphTheory):*

> \({H}^{*}\): = *Graph([u,v,w,x], {{u,v},{u,w},{u,x},{x,w}}):*

* > DrawGraph(*
\({H}^{*}\)
*, style = circle):*

* > P: = ChromaticPolynomial(*
\({H}^{*}\)
*,k)*

> *eval(P, k* = *2)*

> *eval(P, k* = *3)*

Here, the smallest positive integer \(k\) so that \({P}_{s}^{f}\left(G,k\right)\ne 0\) is 3. Therefore, by Definition 2\({\chi }_{s}^{f}\left(G\right)=3.\)

### Example 3

Consider the fuzzy graphs in Fig. 2 and Fig. 3. Find \({\chi }_{s}^{f}\left(G\right)\) by Maple.

First, consider the fuzzy graph \(G\) in Fig. 2. The Maple commands to find \({\chi }_{s}^{f}\left(G\right)\) are as follows.

> *with(GraphTheory):*

> \({G}^{*}\): = *Graph([u,v,w,x,y], {{u,v},{v,w},{w,x},{x,y},{y,u}}):*

> *DrawGraph(*\({G}^{*}\)*, style* = *circle):*

> *P:* = *ChromaticPolynomial(*\({G}^{*}\)*,k)*

> *eval(P, k* = *2)*

> *eval(P, k* = *3)*

Here, the smallest positive integer \(k\) so that \({P}_{s}^{f}\left(G,k\right)\ne 0\) is 3. Therefore, by Definition 2\({\chi }_{s}^{f}\left(G\right)=3.\)

Similarly, consider the fuzzy graph \(G\) in Fig. 3, the Maple commands to find \({\chi }_{s}^{f}\left(G\right)\) is as follows.

> *with(GraphTheory):*

> *with(SpecialGraphs):*

> *G:* = *CompleteGraph(4):*

> *DrawGraph(G, style* = *planar):*

> *P:* = *ChromaticPolynomial(G,k)*

> *eval(P, k* = *3)*

> *eval(P, k* = *4)*

Here, the smallest positive integer \(k\) so that \({P}_{s}^{f}\left(G,k\right)\ne 0\) is 4. Therefore, by Definition 2\({\chi }_{s}^{f}\left(G\right)=4.\)

### Conclusion

The findings of the present study showed that the maple software can be applied to obtain the strong fuzzy chromatic polynomials of fuzzy graphs and to find their strong fuzzy chromatic numbers when the existing methods were not applicable. In the future work, we will apply Maple tool to compute the chromatic polynomial of the Intuitionistic Fuzzy Graphs.

### Limitations

This study focuses on how to use the maple software on some fuzzy graphs to find out the strong fuzzy chromatic polynomial, and strong fuzzy chromatic number. The results obtained by maple are exactly the same as the results obtained by the existing methods. The maple software can be used and more meaningful when the number of vertices and edges in a fuzzy graph is increased.

## Availability of data and materials

The authors declare that the data supporting the findings are included in the paper.

## References

Zadeh LA. Fuzzy sets. Inf Comput. 1965;8(3):338–53.

Rosenfeld A. Fuzzy graphs. In: Zadeh LA, Fu KS, Shimura M, editors. Fuzzy sets and their applications. New York, NY: Academic Press; 1975. p. 77–95.

Bhattacharya P. Some remarks on fuzzy graphs. Pattern Recogn Lett. 1987;6(5):297–302.

Bhutani KR. On automorphisms of fuzzy graphs. Pattern Recogn Lett. 1989;9(3):159–62.

Mordeson JN, Peng CS. Operations on fuzzy graphs. Inf Sci. 1994;79(3–4):159–70.

Mordeson JN, Nair PS. Cycles and cocycles of fuzzy graphs. Inf Sci. 1996;1–4:39–49.

Sunitha MS, Vijayakumar A. A characterization of fuzzy trees. Inf Sci. 1999;113(3–4):293–300.

Bhutani KR, Rosenfeld A. Strong arcs in fuzzy graphs. Inf Sci. 2003;152:319–22.

Mathew S, Sunitha MS. Types of arcs in a fuzzy graph. Inf Sci. 2009;179(11):1760–8.

Mathew S, Sunitha MS. Node connectivity and arc connectivity of a fuzzy graph. Inf Sci. 2010;180(4):519–53.

Mathew S, Mordeson JN, Malik DS. Fuzzy graph theory, vol. 363. Springer International Publishing AG; 2018.

Mordeson JN, Mathew S. Advanced topics in fuzzy graph theory. Cham: Springer Nature; 2019.

Muñoz SM, Ortuno T, Ramirez J, Yanez J. Coloring fuzzy graphs. Omega. 2005;33(3):211–21.

Samanta S, Pramanik T, Pal M. Fuzzy colouring of fuzzy graphs. Afr Mat. 2016;27(1–2):37–50.

Firouzian S, Jouybari MN. Coloring fuzzy graphs and traffic light Problem. J Math Comput Sci. 2011;2(3):431–5.

Dey A, Pal A. Fuzzy graph coloring technique to classify the accidental zone of a traffic control. Ann Pure Appl Math. 2013;3(2):169–78.

Eslahchi C, Onagh BN. Vertex-strength of fuzzy graphs. Int J Math Math Sci. 2006;2006:1–9.

Tanmoy M, Madhumangal P. Fuzzy colouring of m-polar fuzzy graph and its application. J Intell Fuzzy Syst. 2018;35(6):6379–91.

Rosyida I, Indrati CR, Indriati D. Fuzzy chromatic number of union of fuzzy graphs: an algorithm, properties, and its application. Fuzzy Sets Syst. 2020;384:115–213.

Kishore A, Sunitha MS. Strong chromatic number of fuzzy graphs. Ann Pure Appl Math. 2014;7:52–60.

Mamo AA, Srinivasa Rao RVN. Fuzzy chromatic polynomial of fuzzy graphs with crisp and fuzzy vertices using α-cuts. Adv Fuzzy Syst. 2019;2019:1–11.

Mamo AA, Srinivasa Rao RVN. Algebraic properties of fuzzy chromatic polynomials. IOSR J Math (IOSR-JM). 2019;15(6):49–52.

Mamo AA, Srinivasa Rao RVN. Strong fuzzy chromatic polynomial of fuzzy graphs and some fuzzy graph structures with applications. Pure Appl Math J. 2020;9(1):16–25.

Bernardin L, Chin P, Demarco P, Geddes K, Hare D, Heal K, Labahn G, May J, Mccarron J, Monagan M. Maple programming guide. Maplesoft Waterloo; 2011.

Habeeb ZT. Solving of chromatic number, chromatic polynomial and chromaticity for a kind of 6-bridge graph using Maplesoft. J Sci. 2017;58(4A):1955–62.

Goyal S, Garg P, Mishra VN. New corona and new cluster of graphs and their wiener index. Electron J Math Anal Appl. 2020;8(1):100–8.

Goyal S, Jain D, Mishra VN. Wiener index of sum of shadow graphs. Discret Math Algorithm Appl. 2022. https://0-doi-org.brum.beds.ac.uk/10.1142/S,;1793830922500689.

Praveena K, Venkatachalam M, Rohini A, Mishra VN. Equitable coloring on subdivision-vertex join and subdivision-edge join of graphs. Ital J Pure Appl Math. 2021;46:836–49.

Goyal S, Garg P, Mishra VN. New composition of graphs and their wiener indices. Appl Math Nonlinear Sci. 2019;4:175–80. https://0-doi-org.brum.beds.ac.uk/10.2478/AMNS.2019.1.00016.

Mishra VN, Delen S, Cangul IN. Algebraic structure of graph operations in terms of degree sequences. Int J Anal Appl. 2018;16(6):809–21.

Sharma MK, Yadav H, Dhiman N, Mishra VN. Fuzzy reliability evaluation of complex systems with monte carlo simulation. AIP Conf Proc. 2021;2364: 020025. https://0-doi-org.brum.beds.ac.uk/10.1063/5.0062861.

Mishra VN, Delen S, Cangul IN. Degree sequences of join and corona products of graphs. Electron J Math Anal Appl. 2019;7(1):5–13.

Mishra VN. Some problems on approximations of functions in banach spaces. PhD thesis, Indian Institute of Technology, Roorkee 247 667, Uttarakhand, India. 2007.

Gowri S, Venkatachalam M, Mishra VN, Mishra LN. On r−dynamic coloring of double star graph families. Palest J Math. 2021;10(1):53–62.

Srinivasa Rao RVN, Lateram ZH, Mamo AA. Chromatic polynomial of intuitionistic fuzzy graphs using alpha beta levels. Int J Math Math Sci. 2022;2022:1–7. https://0-doi-org.brum.beds.ac.uk/10.1155/2022/9320700.

Srinivasa Rao RVN, Keneni AT, Mamo AA. Interval valued intuitionistic fuzzy line graphs. BMC Res Notes. 2022;15(1):1–9.

## Acknowledgements

The authors do thankful to the editor for giving an opportunity to submit our research article in this esteemed Journal.

## Funding

There is no funding support for this work.

## Author information

### Authors and Affiliations

### Contributions

RVNSR involved in formal analysis, methodology, writing and supervising the work. MAA and LR contributed in the conceptualization, methodology, writing a Maple code and editing the article. All authors read and approved the final manuscript.

### Corresponding author

## Ethics declarations

### Ethics approval and consent to participate

Not applicable.

### Consent for publication

Not applicable.

### Competing interests

The authors declared that they have no competing interests.

## Additional information

### Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

## Rights and permissions

**Open Access** This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated in a credit line to the data.

## About this article

### Cite this article

Ashebo, M.A., Rathour, L. & Repalle, V.N.S. Application of maple on computing strong fuzzy chromatic polynomial of fuzzy graphs.
*BMC Res Notes* **15**, 344 (2022). https://0-doi-org.brum.beds.ac.uk/10.1186/s13104-022-06242-6

Received:

Accepted:

Published:

DOI: https://0-doi-org.brum.beds.ac.uk/10.1186/s13104-022-06242-6

### Keywords

- Strong fuzzy chromatic polynomial
- Strong fuzzy chromatic number
- Fuzzy graph
- Maple

### Mathematics Subject Classification

- 05C72
- 05C15
- 05C31