Search arXivSearch

arXiv · 2604.14195

$RD_α$-Spectra of Joined Union Graphs with Applications to Power Graphs of Finite Groups

Abstract

The \emph{generalized reciprocal distance matrix} of a graph $\mathscr{G}$, denoted by $RD_α(\mathscr{G})$, is defined as $RD_α(\mathscr{G})=α\,RT_r(\mathscr{G})+(1-α)\,RD(\mathscr{G}), \, α\in[0,1],$ where $RT_r(\mathscr{G})$ represents the diagonal matrix of reciprocal vertex transmissions, and $RD(\mathscr{G})$ is the Harary (reciprocal distance) matrix of $\mathscr{G}$. In this paper, we investigate the $RD_α$-spectrum of graphs obtained through the joined union operation. We derive explicit formulas for the characteristic polynomial of $RD_α(\mathscr{G})$ when $\mathscr{G}$ is formed as a joined union of regular graphs. These results provide closed-form expressions for the corresponding spectra of several important graph classes. Moreover, we show that the power graphs of the dihedral group $D_{2n}$ and the generalized quaternion group $Q_{4n}$ admit representations as joined union graphs. Using this structural characterization, we determine the $RD_α$-spectra of power graphs arising from various classes of finite groups, including cyclic groups $\mathbb{Z}_n$, dihedral groups $D_{2n}$, generalized quaternion groups $Q_{4n}$, elementary abelian $p$-groups, and certain non-abelian groups of order $pq$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Aditya Singh, Yogendra Singh, Anand Kumar Tiwari. 2026-04-02. $RD_α$-Spectra of Joined Union Graphs with Applications to Power Graphs of Finite Groups. https://arxiv.org/abs/2604.14195

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