Counting dominating sets in cactus chains-Reference-Cited by-同舟云学术

Counting dominating sets in cactus chains

Published:2015 Issue:8 Volume:29 Page:1847-1855
ISSN:0354-5180
Container-title:Filomat
language:en
Short-container-title:Filomat

Author:

Borissevich Kristina¹,Doslic Tomislav²

Affiliation:

1. Innovative University of Eurasia, Engineering Faculty, Pavlodar, Kazakhstan

2. University of Zagreb, Faculty of Civil Engineering, Zagreb, Croatia

Abstract

In this paper we consider the number of dominating sets in cactus chains with triangular and square blocks. We derive and solve the recurrences satisfied by those quantities and investigate their asymptotic behavior. In triangular case we also refine the counting by computing the bivariate generating function. As a corollary, we compute the expected size of a dominating set in a triangular cactus chain of a given length.

Publisher

National Library of Serbia

Subject

General Mathematics

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the number of isolate dominating sets of certain graphs;Asian-European Journal of Mathematics;2023-08-28

2. Counting independent dominating sets in linear polymers;Advanced Studies: Euro-Tbilisi Mathematical Journal;2023-03-01

3. Computing Forgotten Topological Index of Extremal Cactus Chains;Applied Mathematics and Nonlinear Sciences;2020-12-31

4. On total vertex irregularity strength of generalized uniform cactus chain graphs with pendant vertices;Journal of Discrete Mathematical Sciences and Cryptography;2020-08-17

5. On the total edge irregularity strength of general uniform cactus chain graphs with pendant vertices;Journal of Discrete Mathematical Sciences and Cryptography;2020-08-17