English

Non-isomorphic Signatures on Some Generalised Petersen Graph

Combinatorics 2019-01-01 v1

Abstract

In this paper we find the number of different signatures of P(3,1),P(5,1)P(3,1), P(5,1) and P(7,1)P(7,1) upto switching isomorphism, where P(n,k)P(n, k) denotes the generalised Petersen graph, 2k<n2k < n. We also count the number of non-isomorphic signatures on P(2n+1,1)P(2n+1,1) of size two for all n1n \geq 1, and we conjecture that any signature of P(2n+1,1)P(2n+1,1), upto switching, is of size at most n+1n+1.

Cite

@article{arxiv.1812.11360,
  title  = {Non-isomorphic Signatures on Some Generalised Petersen Graph},
  author = {Deepak and Bikash Bhattacharjya},
  journal= {arXiv preprint arXiv:1812.11360},
  year   = {2019}
}
R2 v1 2026-06-23T06:58:45.378Z