Home

Network Biology, 2025, 15(4): 150-162
[XML] [EndNote] [RefManager] [BibTex] [ Full PDF (427K)] [Comment/Review Article]

Article

A study on Nilpotent graph in genetic code algebra

Birinchi Kumar Boruah
Department of Mathematics, Sibsagar University, Sivasagar, Assam 785665, India

Received 8 May 2025;Accepted 28 May 2025;Published online 30 May 2025;Published 1 December 2025
IAEES

Abstract
The genetic code is a set of codons that contains genetic information regarding the creation of protein molecules. We studied nilpotent graphs in genetic code algebra in this work. The vertex set is the set of all non-nilpotent elements of a ring, and two vertices are neighbouring if and only if their sum is nilpotent. Different measurements of centrality have been thoroughly examined in our current paper. We also investigated three network parameters: clustering coefficient, degree of dispersion, and skewness.

Keywords amino acid;centrality measure;correlation coefficient;clustering coefficient;degree of distribution;genetic code;Nilpotent graph.


International Academy of Ecology and Environmental Sciences. E-mail: office@iaees.org
Copyright © 2009-2025 International Academy of Ecology and Environmental Sciences. All rights reserved.
Web administrator: office@iaees.org, website@iaees.org; Last modified: 2025/6/14


Translate page to: