The independence polynomial of n-th central graph of dihedral groups
An independent set of a graph is a set of pairwise non-adjacent vertices while the independence number is the maximum cardinality of an independent set in the graph. The independence polynomial of a graph is defined as a polynomial in which the coefficient is the number of the independent set in the...
Saved in:
Main Authors: | Najmuddin, Nabilah, Sarmin, Nor Haniza, Erfanian, Ahmad, Rahmat, Hamisan |
---|---|
Format: | Article |
Language: | English |
Published: |
Penerbit UTM Press
2017
|
Subjects: | |
Online Access: | http://eprints.utm.my/id/eprint/81280/1/NabilahNajmuddin2017_TheIndependencePolynomialOfNThCentral.pdf http://eprints.utm.my/id/eprint/81280/ https://mjfas.utm.my/index.php/mjfas/article/view/550/pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
General form of domination polynomial for two types of graphs associated to dihedral groups
by: Najmuddin, Nabilah, et al.
Published: (2019) -
The independence and clique polynomials of the center graphs of some finite groups
by: Najmuddin, Nabilah, et al.
Published: (2020) -
Spectrum of cayley graphs of dihedral groups and their energy
by: Sarmin, Nor Haniza, et al.
Published: (2018) -
Independence polynomial of the commuting and noncommuting graphs associated to the quasidihedral group
by: Najmuddin, N., et al.
Published: (2021) -
Maple computations on the energy of cayley graphs for dihedral groups
by: Sarmin, Nor Haniza, et al.
Published: (2018)