Independence polynomial of the commuting and noncommuting graphs associated to the quasidihedral group
An independence polynomial is a type of graph polynomial from graph theory that store combinatorial information such as the graph properties or graph invariants. The independence polynomial of a graph contains coefficients that represent the number of independent sets of certain sizes and the degree...
Main Authors: | Najmuddin, N., Sarmin, N. H., Erfanian, A. |
---|---|
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2021
|
Subjects: | |
Online Access: | http://eprints.utm.my/95673/1/NabilahNajmuddin2021_IndependencePolynomialoftheCommuting.pdf |
Similar Items
-
Domination polynomial of the commuting and noncommuting graphs of some finite nonabelian groups
by: Najmuddin, N., et al.
Published: (2019) -
The independence and clique polynomials of the center graphs of some finite groups
by: Najmuddin, Nabilah, et al.
Published: (2020) -
The topological indices of non-commuting graph for quasidihedral group
by: Sarmin, Nor Haniza, et al.
Published: (2018) -
General form of domination polynomial for two types of graphs associated to dihedral groups
by: Najmuddin, Nabilah, et al.
Published: (2019) -
The Harary index of the non-commuting graph for dihedral groups
by: Alimon, N. I., et al.
Published: (2020)