Next Article in Journal
Unsupervised Multi-Object Detection for Video Surveillance Using Memory-Based Recurrent Attention Networks
Previous Article in Journal
Introduction to the Special Issue: Applications of Internet of Things
Article Menu
Issue 9 (September) cover image

Export Article

Open AccessArticle
Symmetry 2018, 10(9), 373; https://doi.org/10.3390/sym10090373

New Concepts on Vertex and Edge Coloring of Simple Vague Graphs

1
Department of Computer Science and Engineering, Saroj Mohan Institute of Technology, Hooghly 712512, West Bengal, India
2
Division of Data Science, Ton Duc Thang University, Ho Chi Minh City 700000, Vietnam
3
Faculty of Information Technology, Ton Duc Thang University, Ho Chi Minh City 700000, Vietnam
4
Information Technology Department, Al Musanna College of Technology, Sultanate of Oman 111, Oman
5
Faculty of Business and Information Science, UCSI University, Jalan Menara Gading, Cheras, Kuala Lumpur 56000, Malaysia
6
A-Level Academy, UCSI College KL Campus, Lot 12734, JalanChoo Lip Kung, Taman Taynton View, Cheras, Kuala Lumpur 560005, Malaysia
*
Author to whom correspondence should be addressed.
Received: 5 August 2018 / Revised: 16 August 2018 / Accepted: 17 August 2018 / Published: 1 September 2018
Full-Text   |   PDF [3523 KB, uploaded 1 September 2018]   |  

Abstract

The 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
Keywords: vague graphs; fuzzified vague graphs; vertex coloring; edge coloring; fuzzy graph coloring; vague graph coloring problem; traffic flow management; advertisement selection spots vague graphs; fuzzified vague graphs; vertex coloring; edge coloring; fuzzy graph coloring; vague graph coloring problem; traffic flow management; advertisement selection spots
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

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.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Symmetry EISSN 2073-8994 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top