Abstract
A connected graph is said to be self-centered if all its vertices have the same eccentricity. The family of generalized Petersen graphs P(n, k), introduced by Coxeter [6] and named by Watkins [18], is a family of cubic graphs of order 2n defined by positive integral parameters n and k, \(n\ge 2k\). Not all generalized Petersen graphs are self-centered. In this paper, we prove self-centeredness of P(n, k) whenever k divides n and \(k< \frac{n}{2}\), except the case when n is odd and k is even. We also prove non-self-centeredness of generalized Petersen graphs P(n, k) when n even with \(k=\frac{n}{2}\); \(n=4m+2\) with \(k=\frac{n}{2}-1\) for some positive integer \(m\ge 3\); \(n\ge 9\) is odd and \(k=2\) or \(k=\frac{n-1}{2}\); and \(n = m(4m+1 )\pm (m+1)\) with \(k = 4m + 1\) for any positive integer \(m \ge 2\). Finally, we make an exhaustive computer search and get all possible values of n and k for which P(n, k) is non-self-centered.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Beenker, G.F.M., Van Lint, J.H.: Optimal generalized Petersen graphs. Philips J. Res. 43(2), 129–136 (1988)
Buckley, F.: Self-centered graphs. Ann. New York Acad. Sci. 576, 71–78 (1989)
Buckley, F., Miller, Z., Slater, P.J.: On graphs containing a given graph as center. J. Graph Theory 5, 427–434 (1981)
Castagna, F., Prins, G.: Every generalized Petersen graph has a Tait coloring. Pac. J. Math. 40(1), 53–58 (1972)
Chen, L., Ma, Y., Shi, Y., Zhao, Y.: On the [1,2]-domination number of generalized Petersen graphs. Appl. Math. Comput. 327, 1–7 (2018)
Coxeter, H.S.M.: Self-dual configurations and regular graphs. Bull. Am. Math. Soc. 56(5), 413–455 (1950)
Ebrahimi, B.J., Jahanbakht, N., Mahmoodian, E.S.: Vertex domination of generalized Petersen graphs. Discrete Math. 309(13), 4355–4361 (2009)
Frucht, R., Graver, J.E., Watkins, M.E.: The groups of the generalized Petersen graphs. Proc. Camb. Philos. Soc. 70(211), 211–218 (1971)
Fu, X., Yang, Y., Jianga, B.: On the domination number of generalized Petersen graphs \(P(n,2)\). Discrete Math. 309(8), 2445–2451 (2009)
Janakiraman, T.N.: On special classes of self-centered graphs. Discrete Math. 126, 411–414 (1994)
Janakiraman, T.N., Bhanumathi, M., Muthammai, S.: Self-centered super graph of a graph and center number of a graph. Ars Comb. 87, 271–290 (2008)
Huilgol, M.I., Ramprakash, C.: Cyclic edge extensions- self-centered graphs. J. Math. Comput. Sci. 10, 131–137 (2014)
Saražin, M.L., Pacco, W., Previtali, A.: Generalizing the generalized Petersen graphs. Discrete Math. 307(3–5), 534–543 (2007)
Singh, P., Panigrahi, P.: On self-centeredness of product of graphs. Int. J. Comb. 2016, 1–4 (2016). https://doi.org/10.1155/2016/2508156
Singh, P., Panigrahi, P.: On self-centeredness of tensor product of some graphs. Electron. Notes Discrete Math. 63, 333–342 (2017)
Stanic, Z.: Some notes on minimal self-centered graphs. AKCE Int. J. Graphs Comb. 7, 97–102 (2010)
Steimle, A., Staton, W.: The isomorphism classes of the generalized Petersen graphs. Discrete Math. 309(1), 231–237 (2009)
Watkins, M.E.: A theorem on Tait colorings with an application to the generalized petersen graphs. J. Comb. Theory 6(2), 152–164 (1969)
Acknowledgement
We are thankful to the referees for their constructive and detail comments and suggestions which improved the paper overall.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Singh, P., Panigrahi, P., Singh, A. (2020). Self-centeredness of Generalized Petersen Graphs. In: Changat, M., Das, S. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2020. Lecture Notes in Computer Science(), vol 12016. Springer, Cham. https://doi.org/10.1007/978-3-030-39219-2_12
Download citation
DOI: https://doi.org/10.1007/978-3-030-39219-2_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-39218-5
Online ISBN: 978-3-030-39219-2
eBook Packages: Computer ScienceComputer Science (R0)