On the domination number of generalized Petersen graphs P(ck,k).

From MaRDI portal
Publication:2804743

zbMATH Open1349.05265arXiv1103.2427MaRDI QIDQ2804743FDOQ2804743


Authors: Haoli Wang, Xirong Xu, Yuansheng Yang, Guoqing Wang Edit this on Wikidata


Publication date: 4 May 2016

Published in: Ars Combinatoria (Search for Journal in Brave)

Abstract: Let G=(V(G),E(G)) be a simple connected and undirected graph with vertex set V(G) and edge set E(G). A set SsubseteqV(G) is a dominating set if for each vinV(G) either vinS or v is adjacent to some winS. That is, S is a dominating set if and only if N[S]=V(G). The domination number gamma(G) is the minimum cardinalities of minimal dominating sets. In this paper, we give an improved upper bound on the domination number of generalized Petersen graphs P(ck,k) for cgeq3 and kgeq3. We also prove that gamma(P(4k,k))=2k+1 for even k, gamma(P(5k,k))=3k for all kgeq1, and gamma(P(6k,k))=lceilfrac10k3ceil for kgeq1 and keq2.


Full work available at URL: https://arxiv.org/abs/1103.2427




Recommendations





Cited In (16)





This page was built for publication: On the domination number of generalized Petersen graphs \(P(ck,k)\).

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2804743)