Counting independent dominating sets in linear polymers-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Counting independent dominating sets in linear polymers

Published:2023-03-01 Issue:supp1 Volume:16 Page:
ISSN:2667-9930
Container-title:Advanced Studies: Euro-Tbilisi Mathematical Journal
language:
Short-container-title:Adv. Studies: Euro-Tbilisi Math. J.

Author:

Alikhani Saeid,Jahari Somayeh

Publisher

Tbilisi Centre for Mathematical Sciences

Subject

Geometry and Topology,Applied Mathematics,Analysis,Algebra and Number Theory

Reference18 articles.

1. [1] S. Alikhani, On the domination polynomials of non $P_4$ -free graphs, Iran. J. Math. Sci. Inform. 8 (2) (2013) 49-55.

2. [2] S. Alikhani, The domination polynomial of a graph at $-1$ , Graphs Combin. 29 (5) (2013) 1175-1181.

3. [3] S. Alikhani, M. H. Akhbari, R. Hasni, C. Eslahchi, On the number of outer connected dominating sets of graphs, Utilitas Math. 91 (2013) 99-107.

4. [4] K. Borissevich, T. Došlić, Counting dominating sets in cactus chains, Filomat 29 (8) (2015) 1847-1855.

5. [5] M. Chellali, Bounds on the $2$ -domination number in cactus graphs, Opuscula Math. 26 (2006) 5-12.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP