Counting independent sets in two class of edge corona product of graphs

2019 2nd International Conference on Advanced Materials, Intelligent Manufacturing and Automation

Suo, Lang Wang Qing^1 ; Yang, Huan^1 ; Tian, Shuang Liang^1

Mathematics and Computer Institute, Northwest Minzu University, Lanzhou, Gansu

730030, China^1

关键词: Counting independent sets;    Graph G;    Independent set;    NP Complete;    Product graph;    Product of graphs;   

Others  :  https://iopscience.iop.org/article/10.1088/1757-899X/569/5/052015/pdf
DOI  :  10.1088/1757-899X/569/5/052015

来源: IOP

【 摘 要 】

We consider the number of independent sets σ(G). In general, the problem of determining the value of σ(G) is NP-complete. For a graph G, the M-S index is defined as the total number of its independent sets. In this paper, we mainly discusses the M-S index of two classes of edge corona product graphs, and the specific expressions are given.