RT Journal Article
T1 Coloring fuzzy graphs
A1 Ortuño Sánchez, María Teresa
A1 Ramírez, Javier
A1 Yáñez Gestoso, Francisco Javier
A1 Muñoz López, Susana
AB Given a graph G = (V, E), a coloring function C assigns an integer value C(i) to each node i epsilon V in such a way that the extremes of any edge {i,j} epsilon E cannot share the same color, i.e., C(i) epsilon C(j). Two different approaches to the graph coloring problem of a fuzzy graph 6 = ( V, (E) over tilde) are introduced in this paper. The classical concept of the (crisp) chromatic number of a graph is generalized for these approaches. The first approach is based on the successive coloring functions C-x of the crisp graphs G(x) = (T E.), the alpha-cuts of (G) over tilde; the traffic lights problem is analyzed following this approach. The second approach is based on an extension of the concept of coloring function by means of a distance defined between colors; a timetabling problem is analyzed within this approach. An exact algorithm for obtaining the chromatic number associated with the second approach is proposed, and some computational results on randomly generated fuzzy graphs are reported.
PB Pergamon Elsevier Science
SN 0305-0483
YR 2005
FD 2005-06
LK https://hdl.handle.net/20.500.14352/50238
UL https://hdl.handle.net/20.500.14352/50238
LA eng
NO Munoz, S, M Teresaortuno, J Ramirez, y J Yanez. «Coloring Fuzzy Graphs». Omega 33, n.o 3 (junio de 2005): 211-21. https://doi.org/10.1016/j.omega.2004.04.006.
NO Dirección General de Investigación Científica y Técnica (España)
DS Docta Complutense
RD 16 abr 2025