Skip to content
DraconiticResearch
Search Sources API
203,948 studies31 sourcesUpdated 6 min ago
PreprintCC BY 4.0arXiv

DL, DQ Spectrum and Eigenvalue-free Interval of Cayley Graphs over Finite Nilpotent Groups

Abstract

For a finite group G and a symmetric connection set S, we study the distance Laplacian (DL) and distance signless Laplacian (DQ) spectrum of the Cayley graph Cay(G,S) for G a finite nilpotent group. Using the internal direct product decomposition over Sylow subgroups, we reduce every question to a single (possibly non-abelian) prime-power factor. In this setting, the required tools are furnished by ordinary representation theory rather than character theory. Based on this framework, we then derive a complete and explicit formula for every eigenvalue, with multiplicity, of the distance matrix, distance Laplacian, and distance signless Laplacian of Cay(G,S) for G nilpotent: each eigenvalue is indexed by a tuple of irreducible characters of the Sylow factors. Finally, we use the explicit spectrum, together with Perron--Frobenius theory, to determine the eigenvalue-free interval of DL and DQ.

Related

  1. Minimal Cayley graphs with large chromatic number
    James Davies, Meike Hatzel, Liana Yepremyan
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  2. Odd-ordered Cayley graphs satisfy Erdős--Gyárfás
    Michael C. Burkhart
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  3. COLORING SEMIMINIMAL CAYLEY GRAPHS
    Ignacio Garc Ía-Marco, Kolja Knauer, Giuliamaria Menara
    HALPreprintCC BY 4.0Full textGeneral mathematicsHAL
  4. On Edge-Primitive $2$-Arc-Transitive (Bi-)Cayley Graphs
    Hao Nan Chen, Jing Jian Li, Ji Cheng Ma +1
    The Electronic Journal of CombinatoricsPeer-reviewedCC BY 4.0Full textCombinatorics & discrete mathematicsCrossref
  5. Composing group automorphisms with colour-preserving automorphisms of Cayley graphs
    Dave Witte Morris
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
BibTeX
@misc{manna2026spectrum,
  title = {{$D^L$, $D^Q$ Spectrum and Eigenvalue-free Interval of Cayley Graphs over Finite Nilpotent Groups}},
  author = {Pallabi Manna and Santanu Mandal},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.13429},
  eprint = {2610.13429},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.13429},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - D^L, D^Q Spectrum and Eigenvalue-free Interval of Cayley Graphs over Finite Nilpotent Groups
AU  - Pallabi Manna
AU  - Santanu Mandal
PY  - 2026
DA  - 2026/10/09
PB  - arXiv
DO  - 10.48550/arxiv.2610.13429
UR  - https://arxiv.org/abs/2610.13429
AB  - For a finite group G and a symmetric connection set S, we study the distance Laplacian (D^L) and distance signless Laplacian (D^Q) spectrum of the Cayley graph Cay(G,S) for G a finite nilpotent group. Using the internal direct product decomposition over Sylow subgroups, we reduce every question to a single (possibly non-abelian) prime-power factor. In this setting, the required tools are furnished by ordinary representation theory rather than character theory. Based on this framework, we then derive a complete and explicit formula for every eigenvalue, with multiplicity, of the distance matrix, distance Laplacian, and distance signless Laplacian of Cay(G,S) for G nilpotent: each eigenvalue is indexed by a tuple of irreducible characters of the Sylow factors. Finally, we use the explicit spectrum, together with Perron--Frobenius theory, to determine the eigenvalue-free interval of D^L and D^Q.
ER  -