Search arXiv⌕ Search

arXiv · 2508.19616

Various spectral aspects of NCCC-graphs of certain finite non-abelian groups

Abstract

Let ${G}$ be a finite non-abelian group. The non-commuting conjugacy class graph (abbreviated as NCCC-graph) of $G$ is a simple undirected graph whose vertex set is the set of conjugacy classes of non-central elements of $G$ and two vertices $x^G$ and $y^G$ are adjacent to each other if $x'$ and $y'$ does not commute for all $x'\in x^G$ and $y'\in y^G$, where $x^G$ is the conjugacy class of $x \in G$. In this paper, we compute the spectrum, Laplacian spectrum, signless Laplacian spectrum and corresponding energies of NCCC-graphs of certain families of finite non-abelian groups. We determine whether these graphs are integral, L-integral and Q-integral. Further, we compare energy, Laplacian energy and signless Laplacian energy; and determine whether these graphs are borderenergetic, L-borderenergetic, Q-borderenergetic, hyperenergetic, L-hyperenergetic or Q-hyperenergetic.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rishabh Chakraborty, Firdous Ee Jannat, Rajat Kanti Nath. 2025-08-27. Various spectral aspects of NCCC-graphs of certain finite non-abelian groups. https://arxiv.org/abs/2508.19616

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗