Weighted Digraphs and its Spectrum

This paper explores the concept of Weighted Digraphs associated with cyclic groups Zn. Inthese digraphs, each arc is assigned a weight based on modular arithmetic, specifically thesmallest integer r such that y ≡ r · x (mod n), where x and y are vertices of the digraph. Thestudy discusses various properties of these weighted digraphs, including the relationship betweenthe weight of arcs and the order of elements in Zn, the behavior of generators, and theuniqueness of arc weights. The adjacency matrix and degree matrix are defined, and theLaplacian matrix is derived as the difference between these two matrices. Several examples arepresented for Z2, Z3, Z4, Z5, and Z6, showcasing their adjacency matrices, degree matrices,Laplacian matrices, characteristic polynomials, and eigenvalues. The results provide insight intothe structure and properties of weighted digraphs on cyclic groups and demonstrate the useof software tools such as MATLAB for matrix computations.

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2025-03-30
DOI
https://doi.org/10.5281/zenodo.16735467
Primary Topic
Aquatic Ecosystems and Biodiversity
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Weighted Digraphs and its Spectrum

Zenodo (CERN European Organization for Nuclear Research)
Aquatic Ecosystems and Biodiversity
article

Weighted Digraphs and its Spectrum

article en

Abstract

This paper explores the concept of Weighted Digraphs associated with cyclic groups Zn. Inthese digraphs, each arc is assigned a weight based on modular arithmetic, specifically thesmallest integer r such that y ≡ r · x (mod n), where x and y are vertices of the digraph. Thestudy discusses various properties of these weighted digraphs, including the relationship betweenthe weight of arcs and the order of elements in Zn, the behavior of generators, and theuniqueness of arc weights. The adjacency matrix and degree matrix are defined, and theLaplacian matrix is derived as the difference between these two matrices. Several examples arepresented for Z2, Z3, Z4, Z5, and Z6, showcasing their adjacency matrices, degree matrices,Laplacian matrices, characteristic polynomials, and eigenvalues. The results provide insight intothe structure and properties of weighted digraphs on cyclic groups and demonstrate the useof software tools such as MATLAB for matrix computations.

Zenodo (CERN European Organization for Nuclear Research)
Mahatma Gandhi Institute (MU), Mahatma Gandhi University (RW)
Openalex Percentile: Top 53%
Aquatic Ecosystems and Biodiversity
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.