Six signed Petersen graphs, and their automorphisms

From MaRDI portal
Publication:411664

DOI10.1016/J.DISC.2011.12.010zbMATH Open1239.05086arXiv1303.3347OpenAlexW1994722261MaRDI QIDQ411664FDOQ411664


Authors: Thomas Zaslavsky Edit this on Wikidata


Publication date: 30 April 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: Up to switching isomorphism there are six ways to put signs on the edges of the Petersen graph. We prove this by computing switching invariants, especially frustration indices and frustration numbers, switching automorphism groups, chromatic numbers, and numbers of proper 1-colorations, thereby illustrating some of the ideas and methods of signed graph theory. We also calculate automorphism groups and clusterability indices, which are not invariant under switching. In the process we develop new properties of signed graphs, especially of their switching automorphism groups.


Full work available at URL: https://arxiv.org/abs/1303.3347




Recommendations




Cites Work


Cited In (6)





This page was built for publication: Six signed Petersen graphs, and their automorphisms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q411664)