Najmuddin, N. and Sarmin, N. H. and Erfanian, A.
(2019)
*Domination polynomial of the commuting and noncommuting graphs of some finite nonabelian groups.*
In: 1st International Conference on Mathematical Sciences and Technology 2018: Innovative Technologies for Mathematics and Mathematics for Technological Innovation, MathTech 2018, 10-12 Dec 2018, Penang, Malaysia.

Full text not available from this repository.

Official URL: http://www.dx.doi.org/10.1063/1.5136363

## Abstract

A dominating set S of a graph is a subset of the vertex set of the graph in which the closed neighborhood of S is the whole vertex set. A domination polynomial of a graph contains coefficients that represent the number of dominating sets in the graph. A domination polynomial is usually being obtained for common types of graphs but not for graphs associated to groups. Two types of graphs associated to groups that are used in this research are the commuting graph and the noncommuting graph. The commuting graph of a group G is a graph whose vertex set contains all noncentral elements of G and any two vertices in the set are adjacent if and only if they commute in G. Meanwhile, the noncommuting graph of a group G is a graph whose vertex set contains all noncentral elements of G and any two vertices in the set are adjacent if and only if they do not commute in G. This paper establishes the domination polynomial of the commuting and noncommuting graphs for the dihedral groups, generalized quaternion groups and quasidihedral groups.

Item Type: | Conference or Workshop Item (Paper) |
---|---|

Uncontrolled Keywords: | commuting graph, noncommuting graph |

Subjects: | Q Science > QA Mathematics |

Divisions: | Science |

ID Code: | 91704 |

Deposited By: | Narimah Nawil |

Deposited On: | 27 Jul 2021 13:46 |

Last Modified: | 27 Jul 2021 13:46 |

Repository Staff Only: item control page