Finite Rings and Digraphs: Further Development of Theory and Algorithms

eBiblioteka

 
 

Finite Rings and Digraphs: Further Development of Theory and Algorithms

Show full item record

Title: Finite Rings and Digraphs: Further Development of Theory and Algorithms
Author: Daoub, Hamza
Abstract: In this thesis, we are going to highligth two di erent relations between graphs and nite commutative rings. The rst one is the well known as Unitary Cayley Graph, where the study of this assocciation and some results are presented from [1]. The second one is a completely di erent; it connects digraphs with quadratic polynomials with coe tents in Zn under the mapping (a; b) 7􀀀! (a + b; ab), for some n < 1. A Computer calculations are involved to support the study. The algorithm which is used for these calculations is built on original Mathematica and Matlab Softwares. Furthermore, Some principles are needed in this thesis for the seek of support and completeness. . .
URI: http://hdl.handle.net/123456789/4267
Date: 2013

Files in this item

Files Size Format View
phdHamza_Daoub.pdf 1.154Mb PDF View/Open

The following license files are associated with this item:

This item appears in the following Collection(s)

Show full item record