Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1708656 | Applied Mathematics Letters | 2012 | 5 Pages |
Abstract
Let us denote the independence polynomial of a graph by IG(x). If IG(x)=IH(x) implies that Gâ
H then we say G is independence unique. For graph G and H if IG(x)=IH(x) but G and H are not isomorphic, then we say G and H are independence equivalent. In [7], Brown and Hoshino gave a way to construct independent equivalent graphs for circulant graphs. In this work we give a way to construct the independence equivalent graphs for general simple graphs and obtain some properties of the independence polynomial of paths and cycles.
Keywords
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Hailiang Zhang,