Some Properties of The Spectrum of The Power Digraph Γ(n,k)

For every positive integer n and k , a power digraph modulo n, denoted by Γ(n,k) is constructed with the vertex set Z_n={0,1,2,⋯,n-1}, and a directed edge from a vertex x to a vertex y exists if and only if x^k≡y(mod n), where x,y∈Z_n. In this work, we define the out-adjacency (A_Γ^+) and the in-adjacency (A_Γ^-) matrices of the digraph Γ(n,k) and some results on A_Γ^+ and A_Γ^- are discussed. It is proved that the matrices A_Γ^+ and A_Γ^- are singular if k|ϕ(n) or p^2 |n, for some prime p. Some spectral properties of Γ(n,k) are also presented. Moreover, it is proved that the algebraic multiplicity of 1 as an eigenvalue of A_Γ^+ is the number of components of the digraph Γ(n,k).

Authors

Publication Details

Journal
Communications on Applied Nonlinear Analysis
Published
2024-08-15
DOI
https://doi.org/10.52783/cana.v31.1164
Primary Topic
Graph theory and applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Some Properties of The Spectrum of The Power Digraph Γ(n,k)

Sanjay Kumar Thakur
Communications on Applied Nonlinear Analysis
Graph theory and applications
article

Some Properties of The Spectrum of The Power Digraph Γ(n,k)

Sanjay Kumar Thakur
article en

Abstract

For every positive integer n and k , a power digraph modulo n, denoted by Γ(n,k) is constructed with the vertex set Z_n={0,1,2,⋯,n-1}, and a directed edge from a vertex x to a vertex y exists if and only if x^k≡y(mod n), where x,y∈Z_n. In this work, we define the out-adjacency (A_Γ^+) and the in-adjacency (A_Γ^-) matrices of the digraph Γ(n,k) and some results on A_Γ^+ and A_Γ^- are discussed. It is proved that the matrices A_Γ^+ and A_Γ^- are singular if k|ϕ(n) or p^2 |n, for some prime p. Some spectral properties of Γ(n,k) are also presented. Moreover, it is proved that the algebraic multiplicity of 1 as an eigenvalue of A_Γ^+ is the number of components of the digraph Γ(n,k).

Communications on Applied Nonlinear AnalysisVol. 31(6s)
Openalex Percentile: Top 78%
Graph theory and applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.