The independence and clique polynomials of the center graphs of some finite groups
The independence polynomial and the clique polynomial are the graph poly- nomials that are used to describe the combinatorial information of graphs, including the graphs related to group theory. An independence polynomial of a graph is the polynomial in which its coefficients are the number of indep...
Main Authors: | Najmuddin, Nabilah, Sarmin, Nor Haniza, Erfanian, Ahmad |
---|---|
Format: | Article |
Published: |
Southeast Asian Mathematical Society
2020
|
Subjects: |
Similar Items
-
General form of domination polynomial for two types of graphs associated to dihedral groups
by: Najmuddin, Nabilah, et al.
Published: (2019) -
Domination polynomial of the commuting and noncommuting graphs of some finite nonabelian groups
by: Najmuddin, N., et al.
Published: (2019) -
Independence polynomial of the commuting and noncommuting graphs associated to the quasidihedral group
by: Najmuddin, N., et al.
Published: (2021) -
The orbit graph for some finite solvable groups
by: Omer, S. M. S., et al.
Published: (2014) -
The Laplacian energy of conjugacy class graph of some finite groups
by: Mahmoud, Rabiha, et al.
Published: (2019)