The independence polynomial of inverse commuting graph of dihedral groups
DOI:
https://doi.org/10.11113/mjfas.v16n1.1353Keywords:
Dihedral group, inverse commuting graph, independent sets, independence polynomial.Abstract
Set of vertices not joined by an edge in a graph is called the independent set of the graph. The independence polynomial of a graph is a polynomial whose coefficient is the number of independent sets in the graph. In this research, we introduce and investigate the inverse commuting graph of dihedral groups (D2N) denoted by GIC. It is a graph whose vertex set consists of the non-central elements of the group and for distinct x,y, E D2N, x and y are adjacent if and only if xy = yx = 1 where 1 is the identity element. The independence polynomials of the inverse commuting graph for dihedral groups are also computed. A formula for obtaining such polynomials without getting the independent sets is also found, which was used to compute for dihedral groups of order 18 up to 32.
References
Najmuddin, N., Sarmin, N. H. and Erfanian, A. 2017. The Independence Polynomial of Conjugate Graph and Non-Commuting Graph of Groups of Small Order. Malaysian Journal of Fundamental and Applied Sciences. 13(4): 602-605.
Najmuddin, N., Sarmin, N. H., Erfanian, A. and Rahmat, A. H. 2017. The independence Polynomial of the nth-central Graph. Malaysian Journal of Fundamental and Applied Sciences. 13(3):271-274.
Ferrin, G. 2014. The independence Polynomials. Masters Dissertation University of South Carolina’
Gallian, J. 2010. Contemporary Abstract Algebra. Brooks/Cole: Cengage Learning.
Beineke, L. W. and Wilson, R. J. 2004. Topics in Algebraic Graph Theory. 102. U.S.A: Cambridge University Press.
Hoede, C. and Li. X. 1994. Clique Polynomials and Independence Polynomials of Graphs. Discrete Mathematics, Algorithms and Applications. 125: 219-228.
Parker, C. 2013. The Commuting Graph of a soluble Group. Bulletin of the London Mathematical Society. 45(4): 839-848.
Bapat, R. B. 2010. Graphs and Matrices. New York: Springer.
