Published March 30, 2025 | Version v1

Weighted Digraphs and its Spectrum

Authors/Creators

  • 1. Department of Statistics, Mahatma Gandhi College, Iritty

Description

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

Files

MARCH-25IJAMA2.pdf

Files (394.5 kB)

Name Size
md5:a60d3945e0c27b6defc0cc9f745e3eea
394.5 kB Preview Download

Additional details

Dates

Issued
2025-03-30
This paper explores the concept of Weighted Digraphs associated with cyclic groups Zn. In these digraphs, each arc is assigned a weight based on modular arithmetic, specifically the smallest integer r such that y ≡ r · x (mod n), where x and y are vertices of the digraph. The study discusses various properties of these weighted digraphs, including the relationship between the weight of arcs and the order of elements in Zn, the behavior of generators, and the uniqueness of arc weights. The adjacency matrix and degree matrix are defined, and the Laplacian matrix is derived as the difference between these two matrices. Several examples are presented for Z2, Z3, Z4, Z5, and Z6, showcasing their adjacency matrices, degree matrices, Laplacian matrices, characteristic polynomials, and eigenvalues. The results provide insight into the structure and properties of weighted digraphs on cyclic gro

References

  • C. Adiga, R. Balakrishnan and W. So, The skew energy of digraphs, Linear Algebra, and its Applications, 432(7), (2010), 1825-1835. [2] S. Barnard and J.M. Child, Higher Algebra, London, Macmillan and Co. Ltd, New York, 1959. [3] D. M. Burton, Elementary Number Theory, Mc Graw Hill, Seventh Edition, 2011. [4] C. A. Coulson, On the calculation of the energy in unsaturated hydrocarbon molecules, Mathematical Proceedings of the Cambridge Philosophical Society, 36(2), (2008), 201-203. [5] D. M. Cvetkovi´c, M. Doob and H. Sachs, Spectra of graphs, Theory, and Application, third revised and enlarged edition, J. A. Barth Verlag, Heidelberg-Leipzig, 1995. [6] E. Gudin˜ o and J. Rada, A lower bound for the spectral radius of a digraph, Linear Algebra, and its applications, 433(1), (2010), 233-240. [7] I. Gutman, The energy of a graph, Ber. Math. Stat. Sekt. forschungszentrum Graz. 103, (1978), 1-22. [8] F. Harary, Graph Theory, Narosa Publishing House, 2001. [9] Jimly