On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results

A vertex k-coloring of graph G is distinguishing if the only automorphism of G that preserves the colors is the identity map. It is proper-distinguishing if the coloring is both proper and distinguishing. The distinguishing number ofG, D(G), is the smallest integer k so that G has a distinguishing k-coloring; the distinguishing chromatic number ofG, @g"D(G), is defined similarly. It has been shown recently that the distinguishing number of a planar graph can be determined efficiently by counting a related parameter-the number of inequivalent distinguishing colorings of the graph. In this paper, we demonstrate that the same technique can be used to compute the distinguishing number and the distinguishing chromatic number of an interval graph. We make use of PQ-trees, a classic data structure that has been used to recognize and test the isomorphism of interval graphs; our algorithms run in O(n^3log^3n) time for graphs with n vertices. We also prove a number of results regarding the computational complexity of determining a graph's distinguishing chromatic number.

[1]  Karen L. Collins,et al.  The Distinguishing Chromatic Number , 2006, Electron. J. Comb..

[2]  M. Golumbic.  Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57) , 2004 .

[3]  Melody Chan.  The distinguishing number of the augmented cube and hypercube powers , 2008, Discret. Math..

[4]  Alfred V. Aho,et al.  The design and analysis of algorithms , 1974 .

[5]  Kellogg S. Booth,et al.  Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..

[6]  Michael O. Albertson,et al.  Symmetry Breaking in Graphs , 1996, Electron. J. Comb..

[7]  Nikhil R. Devanur.  Symmetry Breaking in Trees and Planar Graphs by Vertex Coloring Extended , 2004 .

[8]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[9]  Charles J. Colbourn,et al.  Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs , 1981, SIAM J. Comput..

[10]  Wen-Lian Hsu.  O(M*N) Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs , 1995, SIAM J. Comput..

[11]  D. R. Fulkerson,et al.  Incidence matrices and interval graphs , 1965 .

[12]  Dexter Kozen,et al.  The Design and Analysis of Algorithms , 1991, Texts and Monographs in Computer Science.

[13]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[14]  D. West.  Introduction to Graph Theory , 1995 .

[15]  Ranjan Chaudhuri,et al.  Teaching bit-level algorithm analysis to the undergraduates in computer science , 2004, SGCS.

[16]  Alexander Russell,et al.  A Note on the Asymptotics and Computational Complexity of Graph Distinguishability , 1998, Electron. J. Comb..

[17]  Christine T. Cheng.  On Computing the Distinguishing Numbers of Trees and Forests , 2006, Electron. J. Comb..

[18]  Kellogg S. Booth,et al.  A Linear Time Algorithm for Deciding Interval Graph Isomorphism , 1979, JACM.

[19]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[20]  Lenore Cowen,et al.  The distinguishing number of the hypercube , 2004, Discret. Math..

[21]  Nikhil R. Devanur,et al.  On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach , 2007, SIAM J. Discret. Math..