Publication:
On the strong domination number of proper enhanced power graphs of finite groups

dc.contributor.affiliationDA-IICT, Gandhinagar
dc.contributor.authorBera, Sudip
dc.date.accessioned2025-08-01T13:09:24Z
dc.description.abstractThe enhanced power graph of a group�G�is a graph with vertex set�G, where two distinct vertices�??�and�??�are adjacent if and only if there exists an element�??�in�G�such that both�??�and�??�are powers of�??. To obtain the proper enhanced power graph, we consider the induced subgraph on the set�, 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.
dc.format.extent177–191
dc.identifier.citationBera, Sudip, "On the strong domination number of proper enhanced power graphs of finite groups," Acta Mathematica Hungarica, Springer, ISSN: 1588-2632, vol. 174, Oct. 2024, pp. 177–191, doi: 10.1007/s10474-024-01477-0.
dc.identifier.doi10.1007/s10474-024-01477-0
dc.identifier.issn1588-2632
dc.identifier.scopus2-s2.0-85206806189
dc.identifier.urihttps://ir.daiict.ac.in/handle/dau.ir/1912
dc.language.isoen
dc.publisherSpringer
dc.relation.ispartofseriesVol. 174; No.
dc.sourceActa Mathematica Hungarica
dc.source.urihttps://link.springer.com/article/10.1007/s10474-024-01477-0
dc.titleOn the strong domination number of proper enhanced power graphs of finite groups
dspace.entity.typePublication
relation.isAuthorOfPublication69ec816f-582d-401e-a386-4f0798462d92
relation.isAuthorOfPublication69ec816f-582d-401e-a386-4f0798462d92
relation.isAuthorOfPublication.latestForDiscovery69ec816f-582d-401e-a386-4f0798462d92

Files

Collections