# Six signed Petersen graphs, and their automorphisms

```@article{Zaslavsky2012SixSP,
title={Six signed Petersen graphs, and their automorphisms},
author={Thomas Zaslavsky},
journal={Discret. Math.},
year={2012},
volume={312},
pages={1558-1583}
}```
15 Citations

### Concerning Some Properties of Signed Graphs Associated With Specific Graphs

• Mathematics
• 2019
Two signed graphs are called switching isomorphic if one of them is isomorphic to a switching equivalent of the other. To determine the number of switching non-isomorphic signed graphs on a specific

### The chromatic polynomials of signed Petersen graphs

• Mathematics
• 2015
Zaslavsky proved in 2012 that, up to switching isomorphism, there are six different signed Petersen graphs and that they could be told apart by their chromatic polynomials, by showing that the latter

### Computing the Chromatic Polynomials of the Six Signed Petersen Graphs

• Mathematics
• 2012
Graphs are a collection of vertices and edges that connect some vertices to others. Signed graphs are graphs whose edges are assigned positive or negative labels and may contain loops. Signed graphs

### Signed Complete Graphs on Six Vertices

• Mathematics
• 2018
A signed graph is a graph whose edges are labeled positive or negative. The sign of a cycle is the product of the signs of its edges. Zaslavsky proved in 2012 that, up to switching isomorphism, there

### Some Topics concerning Graphs, Signed Graphs and Matroids

We discuss well-quasi-ordering in graphs and signed graphs, giving two short proofs of the bounded case of S. B. Rao’s conjecture. We give a characterization of graphs whose bicircular matroids are

### Signed Chromatic Polynomials of Signed Book Graphs

• Mathematics
• 2018
In 2015, Matthias Beck and his team developed a computer program in SAGE which efficiently determines the number of signed proper \$k\$-colorings for a given signed graph. In this article, we determine

### Non-isomorphic signatures on some generalised Petersen graph

• Mathematics
Electron. J. Graph Theory Appl.
• 2021
In this paper we find the number of different signatures of \$P(3,1), P(5,1)\$ and \$P(7,1)\$ upto switching isomorphism, where \$P(n, k)\$ denotes the generalised Petersen graph, \$2k < n\$. We also count

### Enumeration of Switching Non-isomorphic Signed Wheels

• Mathematics
• 2021
Two signed graphs are called switching isomorphic to each other if one is isomorphic to a switching of the other. The wheel Wn is the join of the cycle Cn and a vertex. For 0 ≤ p ≤ n, ψp(n) is

### Frustration in signed graphs

Zaslavsky conjectured the following: The minimum number of vertices to be deleted to restore balance in a subcubic signed graph is the same as the minimum number of edges to be deleted to restore