Vertex Coloring of A Complement Fuzzy Graph

Authors

  • R. Vinitha  M.Phil Mathematics Department of Mathematics, Dr.SNS Rajalakshmi College of Arts and Science, (Autonomous) Coimbatore
  • H. Haseena Begum  Assistant professor Department of Mathematics, Dr.SNS Rajalakshmi College of Arts and Science, (Autonomous) Coimbatore

Keywords:

Complement Fuzzy Graph, Vertex Coloring, Cut of Fuzzy Graph

Abstract

G(V, γ, δ) be a simple connected undirected graph where V is a set of vertices and each vertices has a membership value . Colors are assigned to the vertices so that no two adjacent vertices share the same colors. Such an assignment is called vertex coloring. Chromatic number of that graph is the minimum number of color needed to color the graph. In this paper we introduced coloring function of complement of a fuzzy graph.

References

  1. Arindam Dey, Anita pal, "Vertex coloring of a fuzzy graph using alpa cut ".
  2. Daniel Mark, "Graph coloring problems and their applications in Scheduling ".
  3. Arindam Dey, Dhrubajyoti Ghosh, Anita pal, "Edge coloring of a complement fuzzy graph ".
  4. Mordeson J.N, " Operations on Fuzzy graphs".
  5. Mordeson J.N, "Fuzzy line graph ".

International Journal of Scientific Research in Science, Engineering and Technology

Downloads

Published

2018-02-28

Issue

Volume 4, Issue 1, January-February-2018

Section

Research Articles

License

Copyright (c) IJSRSET

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
R. Vinitha, H. Haseena Begum "Vertex Coloring of A Complement Fuzzy Graph" International Journal of Scientific Research in Science, Engineering and Technology (IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099, Volume 4, Issue 1, pp.1505-1509, January-February-2018.