New Concepts on Vertex and Edge Coloring of Simple Vague Graphs
AbstractThe vague graph has found its importance as a closer approximation to real life situations. A review of the literature in this area reveals that the edge coloring problem for vague graphs has not been studied until now. Therefore, in this paper, we analyse the concept of vertex and edge coloring on simple vague graphs. Specifically, two new definitions for vague graphs related to the concept of the λ-strong-adjacent and ζ-strong-incident of vague graphs are introduced. We consider the color classes to analyze the coloring on the vertices in vague graphs. The proposed method illustrates the concept of coloring on vague graphs, using the definition of color class, which depends only on the truth membership function. Applications of the proposal in solving practical problems related to traffic flow management and the selection of advertisement spots are mainly discussed. View Full-Text
Share & Cite This Article
Dey, A.; Son, L.H.; Kumar, P.K.K.; Selvachandran, G.; Quek, S.G. New Concepts on Vertex and Edge Coloring of Simple Vague Graphs. Symmetry 2018, 10, 373.
Dey A, Son LH, Kumar PKK, Selvachandran G, Quek SG. New Concepts on Vertex and Edge Coloring of Simple Vague Graphs. Symmetry. 2018; 10(9):373.Chicago/Turabian Style
Dey, Arindam; Son, Le H.; Kumar, P. K.K.; Selvachandran, Ganeshsree; Quek, Shio G. 2018. "New Concepts on Vertex and Edge Coloring of Simple Vague Graphs." Symmetry 10, no. 9: 373.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.