Halldorsson, Magnus and Kitaev, Sergey and Pyatkin, Artem (2011) *Alternation graphs.* [Proceedings Paper]

## Abstract

A graph G = (V,E) is an alternation graph if there exists a word W over the alphabet V such that letters x and y alternate in W if and only if (x,y) ∈ E for each x ≠ y. In this paper we give an effective characterization of alternation graphs in terms of orientations. Namely, we show that a graph is an alternation graph if and only if it admits a semi-transitive orientation defined in the paper. This allows us to prove a number of results about alternation graphs, in particular showing that the recognition problem is in NP, and that alternation graphs include all 3-colorable graphs. We also explore bounds on the size of the word representation of the graph. A graph G is a k-alternation graph if it is represented by a word in which each letter occurs exactly k times; the alternation number of G is the minimum k for which G is a k-alternation graph. We show that the alternation number is always at most n, while there exist graphs for which it is n/2.

Item type: | Proceedings Paper |
---|---|

ID code: | 34557 |

Keywords: | alternation graphs, computer science, recognition problem, Electronic computers. Computer science |

Subjects: | Science > Mathematics > Electronic computers. Computer science |

Department: | Faculty of Science > Computer and Information Sciences |

Related URLs: | |

Depositing user: | Pure Administrator |

Date Deposited: | 09 Nov 2011 15:08 |

Last modified: | 06 Aug 2013 12:01 |

URI: | http://strathprints.strath.ac.uk/id/eprint/34557 |

### Actions (login required)

View Item |