Introductory Essentials to Blockchain, Hashing and Graphs | Chapter 4 | Finite Abelian Groups, Elliptic Curves, Blockchain with Hashing and Graphs

 

The present study explains the reasons behind decentralization and introduces the basic concepts of blockchain technology with clear references to its key components, such as consensus mechanisms and peer-to-peer networks. An explanation of hashing is treated with different examples of classical algorithms, as this is very important in blockchain signatures. A brief introduction to graphs is also presented since they are used to develop decentralization and counterattacks. Finally, we introduce 16 exercises on these two elements.

Author(s) Details

Seddik Abdelalim
LMFA, FSAC, University Hassan II of Casablanca, Morocco.

 

Ilias Elmouki
LMFA, FSAC, University Hassan II of Casablanca, Morocco.

 

Noreddine Abghour
LIS Labs, FSAC, University Hassan II of Casablanca, Morocco.

 

Please see the book here:- https://doi.org/10.9734/bpi/mono/978-81-992493-9-4/CH4

 

Study on Detour Distance and Self Centered Graphs | Chapter 05 | Recent Advances in Mathematical Research and Computer Science Vol. 2

 This research looks at the detour distance of a graph, as well as the issues that come with it. We look at graph detour eccentricity and average detour eccentricity, as well as some of the characteristics that connect self-centered graphs to detour distance. A tree characterisation is also provided.

Author(S) Details

K. R. Sandeep Narayan
Department of Mathematics, V.T.Bhattathiripad College, Mannampatta, Palakkad, Kerala, 678633, India.

M. S. Sunitha
Department of Mathematics, National Institute of Technology, Calicut, India.

View Book:- https://stm.bookpi.org/RAMRCS-V2/article/view/4452