Abstract
The computation of the chromatic number of circulant graph is essentially hard as in the general case. However in this case it is possible to use spectral properties of the graph to obtain a good coloration. In this paper we use these properties to construct two heuristic algorithms to color a circulant graph. In the case of sparse graphs, we show that our heuristic algorithms give results better than the classical ones.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alon, N., Kahale, N.: A Spectral Technique for Coloring Random 3-Colorable Graphs. In: Proceedings of The 26th Annual Symposium on the Theory of Computing, pp. 346–355. ACM Press, New York (1994)
Aspvall, B., Gilbert, J.R.: Graph Coloring using Eigenvalue Decomposition. Algebraic Discrete Methods 5, 526–538 (1984)
Berger, B., Rompel, J.: A Better Performance Guarantee for Approximate Graph Coloring. Algorithmica 5, 459–466 (1990)
Bermond, J.C., Comellas, F., Hsu, D.F.: Distributed loop computer networks A survey. Journal of Parallel andDistributed Computing 24, 2–10 (1995)
Biggs, N.: Algebraic Graph Theory. Cambridge University. Press, Cambridge (1974)
Burkard, R.E., Sandlholzer, W.: Efficiently solvable special cases of bottleneck travelling salesman problems. Discrete Applied Mathematics 32, 61–76 (1991)
Chan, T.: An Optimal Circulant Preconditioner for Toeplitz System. SIAM J. Sci. Stat. Comput. 9, 766–771 (1988)
Chan, R., Yip, A.M., Ng, M.K.: The best Circulant Preconditioners for Hermitian Toeplitz matrices. SIAM J. Numeric. Anal. 38, 876–896 (2001)
Codenotti, B., Gerace, I., Vigna, S.: Hardness Results and Spectral Techniques for Combinatorial Problems on Circulant Graphs. Linear Algebra and its Applications 285, 123–142 (1998)
Cvectović, D.M., Doob, M., Sachs, H.: Spectra of Graphs. Academic Press, New York (1978)
Elspas, B., Turner, J.: Graphs with Circulant Adjacency Matrices. J. of Combinatorial Theory 9, 297–307 (1970)
Gerace, I., Pucci, P., Ceccarelli, N., Discepoli, M., Mariani, R.: A Preconditioned Finite Elements Method for the p-Laplacian Parabolic Equation. Appl. Num. Anal. Comp. Math. 1, 155–164 (2004)
Håstad, J.: Clique is Hard to Approximate within n to the power (1-epsilon). Acta Mathematica 182, 105–142 (1999)
Karp, R.M.: Reducibility among Combinatorial Problems. In: Miller, R.E., Thatcher (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press, New York (1972)
Leighton, F.T.: Introduction to parallel algorithms and architecture: Arrays, trees, hypercubes. M. Kaufman, San Francisco (1992)
Litow, B., Maus, B.: On isomorphic chordal ring. In: Proc. of The Seventh Australian Workshop on Combinatorial Algorithms (AWOCA 1996), BDCS-TR-508, pp. 108– 111 (1996)
Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. Journal of the ACM 41, 960–981 (1994)
Turner, J.: Point-Symmetric Graphs with Prime Number of Points. Journal of Combinatorial Theory 3, 136–145 (1967)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Discepoli, M., Gerace, I., Mariani, R., Remigi, A. (2004). A Spectral Technique to Solve the Chromatic Number Problem in Circulant Graphs. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds) Computational Science and Its Applications – ICCSA 2004. ICCSA 2004. Lecture Notes in Computer Science, vol 3045. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24767-8_79
Download citation
DOI: https://doi.org/10.1007/978-3-540-24767-8_79
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22057-2
Online ISBN: 978-3-540-24767-8
eBook Packages: Springer Book Archive