Abstract
Let \(G = (V, E)\) be a graph. A set \(S \subseteq V\) is a restrained dominating set (RDS) if every vertex not in S is adjacent to a vertex in S and to a vertex in \(V - S\). The restrained domination number of G, denoted by \(\gamma _r(G)\), is the smallest cardinality of a restrained dominating set of G. Finding the restrained domination number is NP-hard for bipartite and chordal graphs. Let \(G_n^i\) be the family of restrained dominating sets of a graph G of order n with cardinality i, and let \(d_r(G_n, i)=|G_n^i|\). The restrained domination polynomial (RDP) of \(G_n\), \(D_r(G_n, x)\) is defined as \(D_r(G_n, x) = \sum _{i=\gamma _r(G_n)}^{n} d_r(G_n,i)x^i\). In this paper, we focus on the RDP of cycles and have, thus, introduced several novel ways to compute \(d_r(C_n, i)\), where \(C_n\) is a cycle of order n. In the first approach, we use a recursive formula for \(d_r(C_n,i)\); while in the other approach, we construct a generating function to compute \(d_r(C_n,i)\).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Alikhani, S., Peng, Y:: Dominating sets and domination polynomials of cycles. arXiv preprint arXiv:0905.3268 (2009)
Chen, L., Zeng, W., Lub, C.: NP-completeness and APX-completeness of restrained domination in graphs. Theoret. Comput. Sci. 448, 1–8 (2012)
Domke, G.S., Hattingh, J.H., Henning, M.A., Markus, L.R.: Restrained domination in graphs. Discret. Math. 203, 61–69 (1999)
Kayathri, K., Kokilambal, G.: Restrained domination polynomial in graphs. J. Discrete Math. Sci. Cryptogr. 14, 761–775 (2019)
Telle, J.A., Proskurowski. A.: Algorithms for vertex partitioning problems on partial k-trees. SIAM J. Discrete Math. 10(4), 529–550 (1997)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Paul, S., Chauhan, R.P., Swain, S. (2022). Novel Ways of Enumerating Restrained Dominating Sets of Cycles. In: Hsieh, SY., Hung, LJ., Klasing, R., Lee, CW., Peng, SL. (eds) New Trends in Computer Technologies and Applications. ICS 2022. Communications in Computer and Information Science, vol 1723. Springer, Singapore. https://doi.org/10.1007/978-981-19-9582-8_12
Download citation
DOI: https://doi.org/10.1007/978-981-19-9582-8_12
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-19-9581-1
Online ISBN: 978-981-19-9582-8
eBook Packages: Computer ScienceComputer Science (R0)