Name
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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.disc.2011.12.010 | Discrete Mathematics |
Keywords | Field | DocType |
switching automorphism,proper graph coloring,petersen graph,frustration,clusterability,balance,switching,signed graph | Graph automorphism,Discrete mathematics,Combinatorics,Vertex-transitive graph,Edge-transitive graph,Signed graph,Generalized Petersen graph,Petersen family,Symmetric graph,Petersen graph,Mathematics | Journal |
Volume | Issue | ISSN |
312 | 9 | Discrete Mathematics 312 (2012), no. 9, 1558-1583 |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| T. Zaslavsky | 1 | 297 | 56.67 |