Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 91 tok/s
Gemini 2.5 Pro 53 tok/s Pro
GPT-5 Medium 29 tok/s
GPT-5 High 26 tok/s Pro
GPT-4o 98 tok/s
GPT OSS 120B 470 tok/s Pro
Kimi K2 216 tok/s Pro
2000 character limit reached

Distance matrix of enhanced power graphs of finite groups (2304.04288v2)

Published 9 Apr 2023 in math.CO

Abstract: The enhanced power graph of a group $G$ is the graph $\mathcal{G}_E(G)$ with vertex set $G$ and edge set $ {(u,v): u, v \in \langle w \rangle,~\mbox{for some}~ w \in G}$. In this paper, we compute the spectrum of the distance matrix of the enhanced power graph of non-abelian groups of order $pq$, dihedral groups, dicyclic groups, elementary abelian groups $\mathrm{El}(pn)$ and the non-cyclic abelian groups $\mathrm{El}(pn)\times\mathrm{El}(qm)$ and $\mathrm{El}(pn)\times \mathbb{Z}_m$, where $p$ and $q$ are distinct primes. For the non-cyclic abelian group $\mathrm{El}(pn)\times \mathrm{El}(qm)$, we also compute the spectrum of the adjacency matrix of its enhanced power graph and the spectrum of the adjacency and the distance matrix of its power graph.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.