Pith. sign in

REVIEW 3 major objections 5 minor 30 references

Laplacian Spectrum of Super Graphs defined on Certain Non-abelian Groups

T0 review · 3 major / 5 minor · reviewed 2026-08-12 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read The paper derives explicit Laplacian spectra for conjugacy superenhanced power graphs of dihedral, generalized quaternion, and semidihedral groups, proving all are L-integral.

desk verdict The main structural theorems are false under the paper's own definition, and the claimed spectra for CSEP(D6) do not match a direct computation. read the letter →

arxiv 2411.16734 v1 pith:RFLIQJPB submitted 2024-11-23 math.CO math.GR

Varun J Kaushik , Ekta , Parveen , Jitender Kumar This is my paper · ORCID
classification math.COmath.GR MSC 05C2505C50
keywords LaplacianspectrumconjugacysuperenhancedpowergraphdihedralgroupgeneralizedquaternionsemidihedralL-integralenhancedsupergraphsongroups
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper sets out to compute the Laplacian spectrum of the conjugacy superenhanced power graph for three infinite families of non-abelian groups: the dihedral group D2n, the generalized quaternion group Q4n, and the semidihedral group SD8n, and also of the conjugacy supercommuting graph of SD8n. A graph is L-integral when every Laplacian eigenvalue is an integer, and the paper's main conclusion is that all the graphs it considers are L-integral, with closed-form characteristic polynomials in n and parity cases. Knowing these spectra immediately gives the number of spanning trees, and the structure theorems express each graph as a join of a clique with a generalized composition of complete graphs. The motivation is to extend the recently determined Laplacian spectra of conjugacy supercommuting graphs to the enhanced-power version of the same construction.

What carries the argument

The central object is the conjugacy superenhanced power graph CSEP(G), whose vertices are group elements and where x is adjacent to y exactly when some conjugate of x and some conjugate of y lie together in a cyclic subgroup of G; the analogous conjugacy supercommuting graph CSCom(G) replaces 'cyclic subgroup' with 'commute'. The carrying mechanism is the reduction of each graph to a generalized composition H[Γ1,...,Γk], often joined with a single universal vertex, with complete graphs as parts, because the Laplacian of such a graph is a block matrix whose diagonal blocks are multiples of I minus the all-ones matrix J. The eigenvalues of αI−J are α (with multiplicity n−1) and α−n (with multiplicity 1), which explains the factors such as (x−n)^{n−2} and (x−(n+1))^{n−1} in the characteristic polynomials.

What would settle it

Build CSEP(D6) by hand: vertices e, a, $a^{2}$, b, ab, $a^{2}$b, joining a conjugate of x to a conjugate of y only when they share a cyclic subgroup. The reflections b, ab, $a^{2}$b form one conjugacy class, but each generates a distinct order-2 subgroup, so they are pairwise non-adjacent and the claimed clique among them is absent; the Laplacian polynomial will differ from x(x−1)(x−4)^2(x−3)(x−6).

Watch

Extended reading notes

Core claim

The central claim, stated on the paper's own terms, is that CSEP(D2n) has the structure K1∨(...)[...] and, for odd n, Laplacian characteristic polynomial x(x−1)(x−(n+1))^{n−1}(x−2n)(x−n)^{n−2}, with parallel formulas for even n, for Q4n, for SD8n, and for CSCom(SD8n). From these polynomials the paper reads off the full Laplacian spectra, all of whose listed eigenvalues are integers, and derives spanning-tree counts by the standard product formula. The proof strategy is structural: identify which conjugacy classes become cliques under the super construction, assemble the graph as a generalized composition, then factor the Laplacian matrix into blocks of the form (mI−J) whose eigenvalues are known.

Load-bearing premise

The proofs assume that any two elements lying in the same conjugacy class are adjacent to each other in the super graph; for reflection classes in the dihedral group this is false, since each reflection generates a different two-element cyclic subgroup.

Editorial extensions

If this is right

  • If the structure theorems hold, CSEP(D2n) is L-integral for every odd n, with spectrum {2n, n+1, ..., n, ..., 1, 0}.
  • The spanning-tree counts follow directly from the spectra: n^{n−2}(n+1)^{n−1} for odd n and n^{n−2}(n/2+1)^{n−2} for even n.
  • The same pipeline gives explicit integer spectra and tree counts for CSEP(Q4n) and CSEP(SD8n) in both parity cases.
  • CSCom(SD8n), which was not covered by the earlier conjugacy supercommuting spectrum paper, now also has closed-form Laplacian spectra.
  • The structure formulas place all these graphs in the known two-dimensional hierarchy of super graphs, so future spectral results for one entry of the hierarchy automatically transfer to the other entries.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A check of the smallest case exposes a likely obstruction: in D6 the three reflections form a single conjugacy class, but no two of them generate the same cyclic subgroup, so under the paper's adjacency definition they are pairwise non-adjacent; the claimed clique structure among reflection classes would then fail, and the listed characteristic polynomial would need correction.
  • The block-spectral method is generic and should transfer to equality and same-order super graphs of these groups, producing analogous integer spectra whenever the equivalence classes happen to be cliques.
  • One testable extension is to run the same computation for the order superenhanced power graph, where the equivalence classes are sets of elements of equal order rather than conjugacy classes.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The paper defines, for a graph A on a group G and an equivalence relation B, the B superA graph, with two vertices adjacent if some representatives of their B-classes are adjacent in A. It then studies the conjugacy superenhanced power graph CSEP(G) (B = conjugacy, A = enhanced power graph) for dihedral groups D2n, generalized quaternion groups Q4n, and semidihedral groups SD8n, and the conjugacy supercommuting graph CSCom(SD8n). The main claims are structural descriptions of these graphs as joins of generalized compositions of complete graphs, Laplacian characteristic polynomials, Laplacian spectra, L-integrality, and spanning tree counts. The structural theorems, however, rely on the assertion that elements of the same conjugacy class are mutually adjacent in the super graph, which is false under the paper's own definition.

Significance. If correct, the paper would provide new examples of L-integral graphs and explicit Laplacian spectra for three families of group-derived graphs, extending the work of Dalal et al. The determinant computations are routine but internally consistent for the matrices written down. The definition of the graph operation is clear, and the paper is largely self-contained. However, the central structural claim is false: for D6 the true conjugacy superenhanced power graph is K1 ∨ (K2 ∪ 3K1), whose Laplacian spectrum is {0,1,1,1,3,6}, not the spectrum predicted by Theorem 3.2. Since the structural theorems feed directly into all spectral, integrality, and spanning-tree results, the claimed results do not hold for the graphs as defined.

major comments (3)
  1. [Theorem 3.1] The proof states: 'the elements of the classes {a^i b} are adjacent to each other and the identity element.' This is false for the conjugacy superenhanced power graph. By the definition in Section 1, two distinct vertices g and h are adjacent in CSEP(G) only if there exist g′ in [g] and h′ in [h] that are adjacent in the enhanced power graph. In D2n, the maximal cyclic subgroups containing reflections are the order-2 subgroups ⟨a^i b⟩, each of which contains only one non-identity element, and ⟨a⟩ contains no reflections. Hence no two distinct reflections in the same conjugacy class are adjacent in PE(D2n), so the induced subgraph on each reflection class is an independent set. For n = 3, the true CSEP(D6) is K1 ∨ (K2 ∪ 3K1), whose Laplacian spectrum is {0,1,1,1,3,6}, whereas Theorem 3.2 gives {0,1,3,4,4,6}. This invalidates Theorem 3.1, Theorem 3.2, Theorem 3.3, and Corollary 3.4.
  2. [Theorems 3.8 and 3.15] The same erroneous same-class adjacency appears in the claimed structures for Q4n and SD8n. In Q4n, two elements a^r b and a^s b of the class C1 = {a^{2i−1}b} lie in a common cyclic subgroup only when {r,s} = {t, t+n}; since t and t+n have the same parity exactly when n is even, for odd n the class C1 induces an independent set, and for even n it induces a matching, not the complete graph K_n that Theorem 3.8 claims for the internal structure of each class. Consequently the Laplacian polynomials in Theorems 3.9 and 3.12, and the spectra in Corollaries 3.10, 3.11, 3.13, and 3.14, do not describe CSEP(Q4n). The claimed K_{2n} blocks on reflection classes of SD8n in Theorem 3.15 suffer from the same flaw, so Theorems 3.16–3.21 are unsupported. The existential step for cross-class pairs (one adjacent pair implying complete bipartiteness between two classes) is valid; the failure is the same-class assertion.
  3. [Theorem 4.1] The proof of the structure of CSCom(SD8n) also assumes that all elements of each reflection class C_j are mutually adjacent in the conjugacy supercommuting graph. This is false: in SD8n with n odd, distinct elements a^{4k}b and a^{4ℓ}b of C1 do not commute, since (a^{4k}b)(a^{4ℓ}b) = a^{4(k−ℓ)} and (a^{4ℓ}b)(a^{4k}b) = a^{4(ℓ−k)}, and these are equal only when 4(k−ℓ) ≡ 0 mod 2n, which cannot happen for distinct k, ℓ when n is odd. Thus the K_n blocks on C1,…,C4 in the claimed structure are incorrect, and the Laplacian spectra in Theorems 4.2 and 4.5 and Corollaries 4.3, 4.4, 4.6, and 4.7 are invalid.
minor comments (5)
  1. [Title and Abstract] There are several typos: 'certian' in the abstract, 'A BELIAN' in the title, 'superco mmuting' in the introduction, and 'are are' in the definition of the B superA graph.
  2. [Theorem 3.16] In the proof, the determinant is labeled 'L(CSCom(SD8n))' but the theorem concerns CSEP(SD8n); the label should read 'L(CSEP(SD8n))'.
  3. [Theorem 4.2] After the row operations, the displayed formula for the characteristic polynomial uses denominator (x−4), but the following equation (3) writes denominator (x−1); this is inconsistent and should be corrected (the final result uses (x−4)).
  4. [Corollary 3.21] The spanning tree formula is printed as '3. 28n−4n4n−2(2n + 2)2n−1(n + 1)2n−2', which appears to be a mangled '3·2^{8n−4} n^{4n−2}(2n+2)^{2n−1}(n+1)^{2n−2}'; the notation should be cleaned up.
  5. [Theorem 3.5] In the displayed matrix for B, the diagonal entries are written as 'n/2 −1', which is inconsistent with the stated B = (n/2 + 1)I − J; the diagonal should be n/2 + 1.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the spectral computations are direct from the definition; the questionable adjacency assertion is a correctness issue, not an equivalence-by-construction.

full rationale

The paper's derivation chain starts from the definition of a B-superA graph (Section 1) and from the lists of conjugacy classes and maximal cyclic subgroups of D2n, Q4n, and SD8n given in the preliminaries. The structure theorems are then used to write down explicit Laplacian matrices and to compute their characteristic polynomials by routine determinant manipulations. I find no fitted parameter renamed as a prediction, no input that is equivalent by definition to the output, and no load-bearing premise imported solely from a self-citation. The citations to the authors' own earlier work, such as [12] and [26], appear only in the literature review and are not used to justify the central spectral claims. External results used, such as [24, Corollary 4.2] for spanning tree counts and [29] for block determinants, are standard and are not the authors' own unverified claims. The proof of Theorem 3.1 asserts that 'the elements of the classes {a^i b} are adjacent to each other and the identity element', and this assertion is used to build the claimed structure of CSEP(D2n). If that assertion is false for D6, as it appears to be because distinct reflections do not share a cyclic subgroup, then the structure theorem and its spectral consequences are wrong. But this is a mathematical error about the enhanced power graph, not a circular step: the assertion is not the definition of CSEP, nor is it a fitted input, nor is it justified only by a self-citation. The same holds for the analogous adjacency claims in Theorem 3.8 for Q4n and Theorem 3.15 for SD8n. Consequently, the appropriate circularity score is 0; any defect in the paper lies in correctness and rigor, not in circular reasoning.

Assumptions & free parameters 0 free parameters · 4 assumptions · 0 invented entities

No free parameters or invented entities appear. The central mathematical content rests on a false structural premise about super graph adjacency; all other assumptions are standard group-theoretic and linear-algebraic facts.

assumptions (4)
  • domain assumption Standard group presentations and conjugacy class descriptions for D2n, Q4n, and SD8n
    Used throughout Theorems 3.1, 3.8, 3.15, and 4.1; these are mostly standard, though the semidihedral class list is incomplete.
  • ad hoc to paper The induced subgraph on a conjugacy class in the super graph is complete
    This premise appears in the proof of Theorem 3.1 ('the elements of the classes {a^i b} are adjacent to each other') and is false under the definition in Section 1; reflection classes in D2n are independent.
  • standard math Standard Laplacian determinant identities for αI + J and block diagonal matrices
    Used in Theorems 3.2, 3.5, 3.9, and others; these identities are correct.
  • standard math Mohar's spanning tree corollary [24, Corollary 4.2]
    Used to convert spectra into spanning tree counts; accepted standard result.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Laplacian Spectrum of Super Graphs defined on Certain Non-abelian Groups." pith.science (2026). https://pith.science/paper/RFLIQJPB

@misc{pith2026241116734,
  author       = {Pith},
  title        = {Pith review of: Laplacian Spectrum of Super Graphs defined on Certain Non-abelian Groups},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/RFLIQJPB}},
  note         = {Machine review of arXiv:2411.16734}
}
abstract

Given a graph $A$ on a group $G$ and an equivalence relation $B$ on $G$, the $B$ super$A$ graph, whose vertex set is $G$ and two vertices $g$, $h$ are adjacent if and only if there exist $g^{\prime} \in[g]$ and $h^{\prime} \in[h]$ such that $g^{\prime}$ and $h^{\prime}$ are adjacent in $A$. Recently, Dalal \emph{et al.} (Spectrum of super commuting graphs of some finite groups, \textit{Computational and Applied Mathematics}, 43(6):348, 2024) obtain the Laplacian spectrum of supercommuting graphs of certain non-abelian groups including the dihedral group and the generalized quaternion group. In this paper, we continue the study of Laplacian spectrum of certian $B$ super$A$ graphs. We obtain the Laplacian spectrum of conjugacy superenhanced power graphs of certain non-abelian groups, namely: dihedral group, generalized quaternion group and semidihedral group. Moreover to enhance the work of Dalal \emph{et al}, we obtain the Laplacian spectrum of conjugacy supercommuting graph of semidihedral group. We prove that graphs considered in this paper are $L$-integral.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

30 extracted references · 30 canonical work pages

  1. [1]

    Aalipour, S

    G. Aalipour, S. Akbari, P. J. Cameron, R. Nikandish, and F . Shaveisi. On the structure of the power graph and the enhanc ed power graph of a group. Electron. J. Combin. , 24(3):# P 3.16, 2017

    work page 2017

  2. [2]

    Abdollahi and A

    A. Abdollahi and A. M. Hassanabadi. Non-cyclic graph ass ociated with a group. J. Algebra Appl. , 8(02):243–257, 2009

    work page 2009

  3. [3]

    F. Ali, S. Fatima, and W. W ang. On the power graphs of certa in finite groups. Linear Multilinear Algebra , 70(19):3803–3817, 2022

    work page 2022

  4. [4]

    Arunkumar, P

    G. Arunkumar, P. J. Cameron, R. Ganeshbabu, and R. K. Nath . Main functions and the spectrum of super graphs. arXiv:240 8.00390, 2024

    work page 2024

  5. [5]

    Arunkumar, P

    G. Arunkumar, P. J. Cameron, and R. K. Nath. Super graphs o n groups, II. Discrete Appl. Math. , 359:371–382, 2024

    work page 2024

  6. [6]

    Arunkumar, P

    G. Arunkumar, P. J. Cameron, R. K. Nath, and L. Selvaganes h. Super graphs on groups, I. Graphs Combin. , 38(3):100, 2022. 20 V ARUN J KAUSHIK, EKTA, PAR VEEN, JITENDER KUMAR

    work page 2022

  7. [7]

    Banerjee

    S. Banerjee. Distance Laplacian spectra of various grap h operations and its application to graphs on algebraic stru ctures. J. Algebra Appl., 22(1):Paper No. 2350022, 26, 2023

    work page 2023

  8. [8]

    Bera and A

    S. Bera and A. K. Bhuniya. On enhanced power graphs of finit e groups. J. Algebra Appl. , 17(8):1850146, 2018

    work page 2018

Show all 30 references
  1. [9]

    Chakrabarty, S

    I. Chakrabarty, S. Ghosh, and M. K. Sen. Undirected power graphs of semigroups. Semigroup Forum, 78(3):410–426, 2009

    2009

  2. [10]

    Chattopadhyay and P

    S. Chattopadhyay and P. Panigrahi. On Laplacian spectr um of power graphs of finite cyclic and dihedral groups. Linear Multilinear Algebra, 63(7):1345–1355, 2015

    2015

  3. [11]

    Chattopadhyay, P

    S. Chattopadhyay, P. Panigrahi, and F. Atik. Spectral r adius of power graphs on certain finite groups. Indag. Math. (N.S.) , 29(2):730– 737, 2018

    2018

  4. [12]

    Dalal and J

    S. Dalal and J. Kumar. On enhanced power graphs of certai n groups. Discrete Math. Algorithms Appl. , 13(1):2050099, 2021

    2021

  5. [13]

    Dalal, S

    S. Dalal, S. Mukherjee, and K. L. Patra. Spectrum of supe r commuting graphs of some finite groups. Comput. Appl. Math. , 43(6):Paper No. 348, 14, 2024

    2024

  6. [14]

    Das and R

    S. Das and R. K. Nath. Super commuting graphs of finite gro ups and their zagreb indices. arXiv:2407.11297, 2024

    2024

  7. [15]

    Dutta, J

    P. Dutta, J. Dutta, and R. K. Nath. Laplacian spectrum of non-commuting graphs of finite groups. Indian J. Pure Appl. Math. , 49(2):205–216, 2018

    2018

  8. [16]

    A. V. Kelarev. On undirected Cayley graphs. Australas. J. Combin. , 25:73–78, 2002

    2002

  9. [17]

    A. V. Kelarev. Ring constructions and applications , volume 9 of Series in Algebra . W orld Scientific Publishing Co., Inc., River Edge, NJ, 2002

    2002

  10. [18]

    A. V. Kelarev. Graph algebras and automata , volume 257. Marcel Dekker, Inc., New York, 2003

    2003

  11. [19]

    A. V. Kelarev. Labelled Cayley graphs and minimal autom ata. Australas. J. Combin. , 30:95–101, 2004

    2004

  12. [20]

    A. V. Kelarev, J. Ryan, and J. Yearwood. Cayley graphs as classifiers for data mining: the influence of asymmetries. Discrete Math., 309(17):5360–5369, 2009

    2009

  13. [21]

    Kumar, L

    A. Kumar, L. Selvaganesh, P. J. Cameron, and T. Tamizh Ch elvam. Recent developments on the power graph of finite group s—a survey. AKCE Int. J. Graphs Comb. , 18(2):65–94, 2021

    2021

  14. [22]

    X. Ma, A. Kelarev, Y. Lin, and K. W ang. A survey on enhance d power graphs of finite groups. Electron. J. Graph Theory Appl. (EJGTA), 10(1):89–111, 2022

    2022

  15. [23]

    Mehranian, A

    Z. Mehranian, A. Gholami, and A. R. Ashrafi. The spectra o f power graphs of certain finite groups. Linear Multilinear Algebra , 65(5):1003–1010, 2017

    2017

  16. [24]

    B. Mohar. The Laplacian spectrum of graphs. In Graph theory, combinatorics, and applications. Vol. 2 (Kal amazoo, MI, 1988) , Wiley-Intersci. Publ., pages 871–898. Wiley, New York, 199 1

    1988

  17. [25]

    R. P. Panda, S. Dalal, and J. Kumar. On the enhanced power graph of a finite group. Comm. Algebra , 49(4):1697–1716, 2021

    2021

  18. [26]

    Dalal, and J

    Parveen, S. Dalal, and J. Kumar. Enhanced power graphs o f certain non-abelian groups. Discrete Math. Algorithms Appl. , 16(5):Paper No. 2350063, 19, 2024

    2024

  19. [27]

    Y. Segev. The commuting graph of minimal nonsolvable gr oups. Geom. Dedicata, 88(1-3):55–66, 2001

    2001

  20. [28]

    D. B. W est. Introduction to Graph Theory . Second edition, Prentice Hall, 1996

    1996

  21. [29]

    F. Zhang. Linear algebra . Johns Hopkins Studies in the Mathematical Sciences. Johns Hopkins University Press, Baltimore, MD,

  22. [1996]

    Challenging problems for students. V arun J Kaushik 1, Ekta 1, Parveen 2, Jitender Kumar 1 Addresses: 1Department of Mathematics, Birla Institute of Technology a nd Science Pilani, Pilani, India 2Department of Mathematics, Indian Institute of Technology Guw ahati, India Email ...

Pith tools

Reviewed August 12, 2026 · model on record in the stance chip above.