Non-isomorphic signatures on some generalised Petersen graph. (English) Zbl 1482.05141
Summary: In this paper we find the number of different signatures of \(P(3, 1)\), \(P(5, 1)\) and \(P(7, 1)\) up to switching isomorphism, where \(P(n, k)\) denotes the generalised Petersen graph, \(2k < n\). We also count the number of non-isomorphic signatures on \(P(2n + 1, 1)\) of size two for all \(n\geq 1\), and we conjecture that any signature of \(P(2n + 1, 1)\), up to switching, is of size at most \(n + 1\).
References:
| [1] | J.A. Bondy and U.S.R. Murty, Graph Theory, Springer, 2008. · Zbl 1134.05001 |
| [2] | D. Cartwright and F. Harary, Structural balance: a generalization of Heiders theory, Psychol. Rev. 63 (1956), 277-293. |
| [3] | R. Frucht, J.E. Graver and M.E. Watkins, The groups of the generalized Petersen graphs, Proc. Cambridge Philos. Soc. 70 (1971), 211-218. · Zbl 0221.05069 |
| [4] | F. Harary, On the notion of balance of a signed graph. Michigan Math. J. 2 (1953-54), 143-146. · Zbl 0056.42103 |
| [5] | R. Naserasr, E. Rollova, and E. Sopena, Homomorphisms of signed graphs, J. Graph Theory, 79 (2015), 178-212. · Zbl 1322.05069 |
| [6] | V. Sivaraman, Some topics concerning graphs, signed graphs and matroids, PhD Thesis, The Ohio State University, 2012. |
| [7] | V. Yegnanarayanan, On some aspects of the generalized Petersen graph, Electron. J. Graph Theory Appl. 5 (2) (2017), 163-178. · Zbl 1467.05037 |
| [8] | T. Zaslavsky, Signed graphs, Discrete Appl. Math. 4 (1) (1982), 47-74. · Zbl 0476.05080 |
| [9] | T. Zaslavsky, Six signed Petersen graphs, and their automorphisms, Discrete Math. 312 (9) (2012), 1558-1583. · Zbl 1239.05086 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
