Minimal Chordal Sense of Direction and Circulant Graphs

A sense of direction is an edge labeling on graphs that follows a globally consistent scheme and is known to considerably reduce the complexity of several distributed problems. In this paper we study a particular instance of sense of direction, called a chordal sense of direction (CSD). In special, we analyze the class of k-regular graphs that admit a CSD with exactly k labels (a minimal CSD). We prove that connected graphs in this class are Hamiltonian and that the class is equivalent to that of circulant graphs, presenting an efficient (polynomial-time) way of recognizing it when the graphs' degree k is fixed.

[1]  Ralph Tindell,et al.  Circulants and their connectivities , 1984, J. Graph Theory.

[2]  Sebastiano Vigna,et al.  Complexity of Deciding Sense of Direction , 1999, SIAM J. Comput..

[3]  Mikhail E. Muzychuk,et al.  Recognizing Circulant Graphs in Polynomial Time: An Application of Association Schemes , 2001, Electron. J. Comb..

[4]  D. Frank Hsu,et al.  Distributed Loop Computer Networks: A Survey , 1995, J. Parallel Distributed Comput..

[5]  Paola Flocchini.  Minimal Sense of Direction in Regular Networks , 1997, Inf. Process. Lett..

[6]  Eugene M. Luks.  Isomorphism of Graphs of Bounded Valence Can Be Tested in Polynomial Time , 1980, FOCS.

[7]  Sebastiano Vigna,et al.  Minimal Sense of Direction and Decision Problems for Cayley Graphs , 1997, Inf. Process. Lett..

[8]  Recognizing Recursive Circulant Graphs G(cd M ; D) , 2007 .

[9]  Bernard Mans,et al.  On the Impact of Sense of Direction on Message Complexity , 1997, Inf. Process. Lett..

[10]  Ronald L. Graham,et al.  Concrete Mathematics, a Foundation for Computer Science , 1991, The Mathematical Gazette.

[11]  Mikhail E. Muzychuk,et al.  Recognizing Circulant Graphs of Prime Order in Polynomial Time , 1998, Electron. J. Comb..

[12]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[13]  J. Mallett.  A Sense of Direction , 2003, Science's STKE.

[14]  Rainer E. Burkard,et al.  Efficiently solvable special cases of bottleneck travelling salesman problems , 1991, Discret. Appl. Math..

[15]  Bernard Mans,et al.  Sense of direction in distributed computing , 2003, Theor. Comput. Sci..

[16]  Nicola Santoro.  Sense of direction, topological awareness and communication complexity , 1984, SIGA.

[17]  B. Elspas,et al.  Graphs with circulant adjacency matrices , 1970 .

[18]  Bernard Mans,et al.  Sense of direction: Definitions, properties, and classes , 1998, Networks.

[19]  André Raspaud,et al.  Recognizing Recursive Circulant Graphs (Extended Abstract) , 2000, Electron. Notes Discret. Math..