LIPIcs.STACS.2015.540.pdf
- Filesize: 0.69 MB
- 14 pages
Document
Automorphism Groups of Geometrically Represented Graphs
Authors
-
Part of:
Volume:
32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Symposium on Theoretical Aspects of Computer Science (STACS) - License:
Creative Commons Attribution 3.0 Unported license
- Publication date: 2015-02-26
Cite AsGet BibTex
Pavel Klavík and Peter Zeman. Automorphism Groups of Geometrically Represented Graphs. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 540-553, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
https://doi.org/10.4230/LIPIcs.STACS.2015.540
https://doi.org/10.4230/LIPIcs.STACS.2015.540
Abstract
Interval graphs are intersection graphs of closed intervals and circle graphs are intersection graphs of chords of a circle. We study automorphism groups of these graphs. We show that interval graphs have the same automorphism groups as trees, and circle graphs have the same
as pseudoforests, which are graphs with at most one cycle in every connected component.
Our technique determines automorphism groups for classes with a
strong structure of all geometric representations, and it can be applied to other graph classes. Our results imply polynomial-time algorithms for computing automorphism groups in term of group products.
Keywords
- automorphism group
- geometric intersection graph
- interval graph
- circle graph
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads