|
|
|
|
total fuzzy graph coloring
|
|
|
|
|
|
|
|
نویسنده
|
saxena smriti ,thapar antika ,bansal richa
|
|
منبع
|
journal of hyperstructures - 2022 - دوره : 11 - شماره : 1 - صفحه:84 -108
|
|
چکیده
|
In this paper, a hybrid genetic algorithm (hga) is pro-posed for the total fuzzy graph coloring (tfgc) problem. tfgc comprises of a graph with fuzzy vertices and edges, seeks to obtain an optimal kcoloring of that fuzzy graph such that the degree ofthe sum of incompatible vertices and edges is minimized. tfgc is also converted into an equivalent binary programming problem andsolved using a cplex solver. the performance of both methods is examined on randomly generated fuzzy graphs and computationalresults are reported. an application based on tfgc is also explored and solved using both proposed methods.
|
|
کلیدواژه
|
fuzzy graph ,incompatibility degree ,total chromatic number ,binary programming and hybrid genetic algorithm
|
|
آدرس
|
dayalbagh educational institute, department of mathematics, india, dayalbagh educational institute, department of mathematics, india, dayalbagh educational institute, department of mathematics, india
|
|
پست الکترونیکی
|
richabansal2007@gmail.com
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|