On the strong domination number of proper enhanced power graphs of finite groups
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929415074611200 |
|---|---|
| author | Bera, Sudip |
| author_facet | Bera, Sudip |
| contents | The enhanced power graph of a group G is a graph with vertex set G, where two distinct vertices x and y are adjacent if and only if there exists an element w in G such that both x and y are powers of w. To obtain the proper enhanced power graph, we consider the induced subgraph on the set G\D, where D represents the set of dominating vertices in the enhanced power graph. In this paper, we aim to determine the strong domination number of the proper enhanced power graphs of finite nilpotent groups. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_06652 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On the strong domination number of proper enhanced power graphs of finite groups Bera, Sudip Combinatorics Group Theory 05C25, 20D10 The enhanced power graph of a group G is a graph with vertex set G, where two distinct vertices x and y are adjacent if and only if there exists an element w in G such that both x and y are powers of w. To obtain the proper enhanced power graph, we consider the induced subgraph on the set G\D, where D represents the set of dominating vertices in the enhanced power graph. In this paper, we aim to determine the strong domination number of the proper enhanced power graphs of finite nilpotent groups. |
| title | On the strong domination number of proper enhanced power graphs of finite groups |
| topic | Combinatorics Group Theory 05C25, 20D10 |
| url | https://arxiv.org/abs/2407.06652 |