General form of domination polynomial for two types of graphs associated to dihedral groups
A domination polynomial is a type of graph polynomial in which its coefficients represent the number of dominating sets in the graph. There are many researches being done on the domination polynomial of some common types of graphs but not yet for graphs associated to finite groups. Two types of grap...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Penerbit UTM Press
2019
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/84880/1/NorHanizaSarmin2019_GeneralFormofDominationPolynomial.pdf http://eprints.utm.my/id/eprint/84880/ https://dx.doi.org/10.11113/matematika.v35.n2.1106 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|