Our site saves small pieces of text information (cookies) on your device in order to deliver better content and for statistical purposes. You can disable the usage of cookies by changing the settings of your browser. By browsing our site without changing the browser settings you grant us permission to store that information on your device.
S. ALIKHANI1,* , S. JAHARI1, M. MEHRYAR1, R. HASNI2
Let G be a simple graph of order n . The domination polynomial of G is the polynomial n i i G D(G, x) = d(G, i)x = ( ) , where d(G, i) is the number of dominating sets of G of size i and (G) is the domination number of G . The number of dominating sets of a graph G is D(G,1) . In this paper we consider cactus chains with triangular and square blocks and study their domination polynomials..
Domination polynomial, Dominating sets, Cactus.
S. ALIKHANI, S. JAHARI, M. MEHRYAR, R. HASNI, Counting the number of dominating sets of cactus chains, Optoelectronics and Advanced Materials - Rapid Communications, 8, 9-10, September-October 2014, pp.955-960 (2014).
Submitted at: June 26, 2014
Accepted at: Sept. 11, 2014
Optoelectronics and Advanced Materials - Rapid Communications
(2023): 0.5 - 2023 Journal Citation Reports (Clarivate Analytics, 2024)
Active accounts were imported to the new platform and assigned a random password by default. In order to access your account you need to access the login page and go through the Lost Password dialog (involves the system sending you an email with instructions) in order to reset your password. This step is necessary as passwords are kept in hashed form and the new platform uses modern hashing algorithms incompatible with the previous ones.