We gratefully acknowledge support from
the Simons Foundation and member institutions.
Full-text links:

Download:

Current browse context:

math.CO

Change to browse by:

References & Citations

Bookmark

(what is this?)
CiteULike logo BibSonomy logo Mendeley logo del.icio.us logo Digg logo Reddit logo

Mathematics > Combinatorics

Title: On connectivity, domination number and spectral radius of the proper enhanced power graphs of finite nilpotent groups

Abstract: For a group $G,$ the enhanced power graph of $G$ is a graph with vertex set $G$ in which two distinct elements $x, y$ are adjacent if and only if there exists an element $w$ in $G$ such that both $x$ and $y$ are powers of $w.$ The proper enhanced power graph is the induced subgraph of the enhanced power graph on the set $G \setminus S,$ where $S$ is the set of dominating vertices of the enhanced power graph. In this paper, we first characterize the dominating vertices of enhanced power graph of any finite nilpotent group. Thereafter, we classify all nilpotent groups $G$ such that the proper enhanced power graphs are connected and find out their diameter. We also explicitly find out the domination number of proper enhanced power graphs of finite nilpotent groups. Finally, we determine the multiplicity of the Laplacian spectral radius of the enhanced power graphs of nilpotent groups.
Comments: 20 pages
Subjects: Combinatorics (math.CO)
MSC classes: 05C25, 20D10
Cite as: arXiv:2108.05175 [math.CO]
  (or arXiv:2108.05175v1 [math.CO] for this version)

Submission history

From: Sudip Bera [view email]
[v1] Wed, 11 Aug 2021 12:09:11 GMT (32kb)

Link back to: arXiv, form interface, contact.