Search arXivSearch

arXiv · 2411.16734

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

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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Varun J Kaushik, Ekta, Parveen, Jitender Kumar. 2024-11-23. Laplacian Spectrum of Super Graphs defined on Certain Non-abelian Groups. https://arxiv.org/abs/2411.16734

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO